java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:56:29,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:56:29,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:56:29,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:56:29,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:56:29,825 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:56:29,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:56:29,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:56:29,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:56:29,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:56:29,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:56:29,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:56:29,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:56:29,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:56:29,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:56:29,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:56:29,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:56:29,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:56:29,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:56:29,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:56:29,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:56:29,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:56:29,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:56:29,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:56:29,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:56:29,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:56:29,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:56:29,867 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:56:29,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:56:29,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:56:29,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:56:29,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:56:29,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:56:29,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:56:29,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:56:29,874 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:56:29,875 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:56:29,900 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:56:29,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:56:29,901 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:56:29,901 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:56:29,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:56:29,901 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:56:29,902 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:56:29,902 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:56:29,902 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:56:29,902 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:56:29,902 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:56:29,903 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:56:29,903 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:56:29,904 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:56:29,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:56:29,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:56:29,905 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:56:29,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:56:29,907 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:56:29,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:56:29,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:56:29,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:56:29,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:56:29,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:56:29,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:56:29,908 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:56:29,908 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:56:29,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:56:29,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:56:29,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:56:29,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:56:29,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:56:29,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:56:29,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:56:29,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:56:29,910 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:56:29,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:56:29,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:56:29,911 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:56:29,911 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:56:29,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:56:29,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:56:29,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:56:29,990 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:56:29,990 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:56:29,991 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-02-15 10:56:29,991 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-02-15 10:56:30,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:56:30,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:56:30,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:56:30,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:56:30,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:56:30,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:56:30,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:56:30,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:56:30,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:56:30,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... [2019-02-15 10:56:30,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:56:30,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:56:30,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:56:30,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:56:30,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:56:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:56:30,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:56:30,461 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:56:30,461 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-15 10:56:30,463 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:56:30 BoogieIcfgContainer [2019-02-15 10:56:30,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:56:30,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:56:30,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:56:30,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:56:30,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:30" (1/2) ... [2019-02-15 10:56:30,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@861fb15 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:56:30, skipping insertion in model container [2019-02-15 10:56:30,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:56:30" (2/2) ... [2019-02-15 10:56:30,488 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-02-15 10:56:30,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:56:30,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-15 10:56:30,534 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-15 10:56:30,562 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:56:30,562 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:56:30,562 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:56:30,563 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:56:30,563 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:56:30,563 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:56:30,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:56:30,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:56:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-15 10:56:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:56:30,584 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:30,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:56:30,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:30,594 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-15 10:56:30,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:30,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:30,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:30,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:30,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:30,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:56:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:56:30,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:56:30,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:56:30,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:56:30,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:56:30,808 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-15 10:56:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:30,969 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-15 10:56:30,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:56:30,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:56:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:30,984 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:56:30,984 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 10:56:30,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:56:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 10:56:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-15 10:56:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 10:56:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-15 10:56:31,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-15 10:56:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:31,018 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-15 10:56:31,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:56:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-15 10:56:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:56:31,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:31,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:56:31,020 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:31,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-15 10:56:31,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:31,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:31,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:31,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:31,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:31,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:31,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:31,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:56:31,197 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-15 10:56:31,255 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:31,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:31,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:31,325 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:56:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:31,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:31,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:31,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:31,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:31,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:31,566 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-15 10:56:31,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:31,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:31,927 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 10:56:31,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:31,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:31,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:32,133 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-15 10:56:32,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:32,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:32,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:32,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:32,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:32,415 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:32,416 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,444 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,461 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,535 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,544 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:32,578 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:32,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:56:32,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,990 INFO L267 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-02-15 10:56:32,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 10:56:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:33,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:33,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:33,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:56:33,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:33,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:56:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:56:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:56:33,141 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-15 10:56:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:33,488 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-15 10:56:33,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:56:33,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:56:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:33,490 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:56:33,490 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 10:56:33,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:56:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 10:56:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-15 10:56:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:56:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-15 10:56:33,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-15 10:56:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:33,498 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-15 10:56:33,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:56:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-15 10:56:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:56:33,499 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:33,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:56:33,500 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-15 10:56:33,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:33,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:33,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:33,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:33,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:56:33,612 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-15 10:56:33,614 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:33,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:33,620 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:33,621 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:56:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:33,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:33,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:33,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:33,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:33,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:33,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:33,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:33,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:33,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:33,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:33,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:33,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:33,924 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:33,925 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,995 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:34,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:34,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:34,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:34,085 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:34,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:56:34,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:56:34,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-15 10:56:34,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-02-15 10:56:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:34,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:34,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:56:34,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:56:34,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:56:34,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:56:34,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:56:34,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:56:34,636 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-15 10:56:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:34,687 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-15 10:56:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:56:34,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:56:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:34,690 INFO L225 Difference]: With dead ends: 18 [2019-02-15 10:56:34,690 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:56:34,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:56:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:56:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 10:56:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:56:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-15 10:56:34,695 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-15 10:56:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:34,696 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-15 10:56:34,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:56:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-15 10:56:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:56:34,696 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:34,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:56:34,697 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-15 10:56:34,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:34,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:34,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:34,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:56:34,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:56:34,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:56:34,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:56:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:56:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:56:34,732 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-15 10:56:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:34,776 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-15 10:56:34,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:56:34,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:56:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:34,777 INFO L225 Difference]: With dead ends: 21 [2019-02-15 10:56:34,777 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 10:56:34,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:56:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 10:56:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-15 10:56:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:56:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-15 10:56:34,783 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-15 10:56:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:34,783 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-15 10:56:34,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:56:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-15 10:56:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:56:34,784 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:34,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:56:34,784 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-15 10:56:34,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:34,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:34,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:34,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:34,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:34,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:34,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:34,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:56:34,894 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-15 10:56:34,896 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:34,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:34,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:34,902 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:56:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:34,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:34,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:34,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:34,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:34,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:34,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:34,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:34,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:34,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:34,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:34,997 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:34,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,057 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:35,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:35,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:35,218 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,228 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,238 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:35,267 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:35,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:56:35,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,343 INFO L267 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-02-15 10:56:35,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 10:56:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:35,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:35,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:35,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:56:35,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:35,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:56:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:56:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:56:35,398 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-15 10:56:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:35,623 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-15 10:56:35,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:56:35,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:56:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:35,627 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:56:35,627 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 10:56:35,628 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-02-15 10:56:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 10:56:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-15 10:56:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 10:56:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-15 10:56:35,633 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-15 10:56:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:35,633 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-15 10:56:35,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:56:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-15 10:56:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:35,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:35,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:35,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-15 10:56:35,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:35,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:35,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:35,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:35,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:35,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:35,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:35,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:35,707 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-15 10:56:35,709 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:35,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:35,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:35,714 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:35,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:35,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:35,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:35,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:35,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:35,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:35,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:35,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:35,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:35,881 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:35,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:36,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:36,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:36,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:36,208 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:36,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:36,229 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:36,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:36,251 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:36,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-15 10:56:36,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:56:36,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 10:56:36,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-02-15 10:56:36,759 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-02-15 10:56:36,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:36,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 10:56:36,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 10:56:37,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:37,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:37,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:37,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:37,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:37,079 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:37,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-15 10:56:37,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:37,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-15 10:56:37,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-02-15 10:56:37,299 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-02-15 10:56:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:37,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:37,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:37,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:37,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:37,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:37,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:37,480 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-15 10:56:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:38,064 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-02-15 10:56:38,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:56:38,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:38,066 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:56:38,067 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:56:38,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:56:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:56:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-02-15 10:56:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 10:56:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-02-15 10:56:38,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-02-15 10:56:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:38,075 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-02-15 10:56:38,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-02-15 10:56:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:38,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:38,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:38,076 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-15 10:56:38,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:38,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:38,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:38,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:38,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:38,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:38,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:38,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:38,138 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-15 10:56:38,140 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:38,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:38,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:38,150 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:56:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:38,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:38,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:38,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:38,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:38,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:38,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:38,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:38,176 INFO L478 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 21 treesize of output 23 [2019-02-15 10:56:38,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:56:38,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:56:38,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 10:56:38,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:56:38,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,426 INFO L478 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 22 treesize of output 38 [2019-02-15 10:56:38,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:56:38,458 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,466 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,475 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:38,495 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 10:56:38,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,526 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-15 10:56:38,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,556 INFO L267 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-02-15 10:56:38,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-15 10:56:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:38,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:38,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:56:38,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:56:38,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:56:38,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:56:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:56:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:56:38,611 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-02-15 10:56:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:38,707 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-02-15 10:56:38,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:56:38,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:56:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:38,708 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:56:38,708 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 10:56:38,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:56:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 10:56:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-15 10:56:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:56:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-02-15 10:56:38,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-02-15 10:56:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:38,724 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-02-15 10:56:38,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:56:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-02-15 10:56:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:38,724 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:38,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:38,726 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-15 10:56:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:38,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:38,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:38,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:38,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:38,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:38,885 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-15 10:56:38,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:38,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:38,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:38,893 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:38,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:38,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:38,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:38,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:38,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:38,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:38,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:38,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:38,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:38,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:38,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:38,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:38,979 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:38,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,001 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:39,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:39,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:39,158 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,169 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,179 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:39,205 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:39,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:56:39,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,325 INFO L267 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-02-15 10:56:39,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:56:39,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,420 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:39,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:56:39,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:39,457 INFO L267 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-02-15 10:56:39,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-15 10:56:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:39,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:39,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:39,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:39,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:39,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:39,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:39,516 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-02-15 10:56:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:39,954 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-02-15 10:56:39,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:56:39,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:39,956 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:56:39,957 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:56:39,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:56:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-02-15 10:56:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 10:56:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-02-15 10:56:39,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-02-15 10:56:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:39,966 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-02-15 10:56:39,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-02-15 10:56:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:39,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:39,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:39,967 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:39,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-02-15 10:56:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:39,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:39,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:39,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:39,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:40,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:40,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:40,016 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:40,016 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-02-15 10:56:40,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:40,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:40,022 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:40,023 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:40,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:40,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:40,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:40,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:40,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:40,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:40,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:40,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:40,129 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:40,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:40,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:40,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:40,177 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:40,178 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,195 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:40,253 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:40,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:56:40,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,314 INFO L267 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-02-15 10:56:40,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:56:40,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:56:40,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,390 INFO L267 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-02-15 10:56:40,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:56:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:40,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:40,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:40,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:40,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:40,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:40,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:40,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:40,447 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-02-15 10:56:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:40,775 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-02-15 10:56:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:40,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:40,777 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:56:40,777 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 10:56:40,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-02-15 10:56:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 10:56:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-15 10:56:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:56:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-15 10:56:40,785 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-15 10:56:40,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:40,786 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-15 10:56:40,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-15 10:56:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:40,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:40,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:40,787 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-15 10:56:40,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:40,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:40,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:40,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:40,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:40,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:40,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:40,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:40,824 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-15 10:56:40,826 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:40,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:40,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:40,831 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:56:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:40,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:40,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:40,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:40,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:40,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:40,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:40,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:40,905 INFO L478 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 21 treesize of output 23 [2019-02-15 10:56:40,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:56:40,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:56:40,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:56:40,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:56:41,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,104 INFO L478 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 36 treesize of output 49 [2019-02-15 10:56:41,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,139 INFO L478 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 32 treesize of output 57 [2019-02-15 10:56:41,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:56:41,189 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,234 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,266 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:41,295 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 10:56:41,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:56:41,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:41,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 10:56:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:41,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:41,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:41,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:56:41,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:41,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:56:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:56:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:56:41,400 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-02-15 10:56:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:41,553 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-02-15 10:56:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:56:41,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:56:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:41,555 INFO L225 Difference]: With dead ends: 42 [2019-02-15 10:56:41,555 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 10:56:41,556 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-02-15 10:56:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 10:56:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-02-15 10:56:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:56:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-15 10:56:41,564 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-15 10:56:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:41,564 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-15 10:56:41,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:56:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-15 10:56:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:41,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:41,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:41,565 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-15 10:56:41,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:41,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:41,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:41,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:41,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:41,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:41,721 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-15 10:56:41,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:41,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:41,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:41,727 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:41,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:41,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:41,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:41,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:41,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:41,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:41,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:41,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:41,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:41,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:41,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:56:41,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,882 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:41,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:56:41,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:56:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:41,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:56:42,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:56:42,049 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,063 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,078 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,094 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:42,123 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 10:56:42,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:42,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,178 INFO L267 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-02-15 10:56:42,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:56:42,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:56:42,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:42,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 10:56:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:42,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:42,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:42,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:42,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:42,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:42,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:42,302 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-02-15 10:56:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:42,680 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-02-15 10:56:42,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:42,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:42,681 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:56:42,682 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:56:42,682 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-02-15 10:56:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:56:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-02-15 10:56:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-15 10:56:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-02-15 10:56:42,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-02-15 10:56:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:42,691 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-02-15 10:56:42,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-02-15 10:56:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:42,692 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:42,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:42,692 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:42,692 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-02-15 10:56:42,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:42,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:42,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:42,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:42,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:42,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:42,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:42,808 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:42,809 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-15 10:56:42,810 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:42,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:42,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:42,815 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:42,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:42,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:42,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:42,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:42,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:42,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:42,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:42,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:42,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:42,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:42,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:42,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:43,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:43,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:43,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:43,038 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:43,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,067 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,093 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,108 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:43,153 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:43,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:56:43,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,242 INFO L267 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-02-15 10:56:43,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:56:43,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:56:43,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,307 INFO L267 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-02-15 10:56:43,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 10:56:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:43,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:43,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:43,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:56:43,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:43,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:56:43,361 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-02-15 10:56:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:43,637 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-02-15 10:56:43,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:43,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:43,639 INFO L225 Difference]: With dead ends: 63 [2019-02-15 10:56:43,639 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 10:56:43,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:56:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 10:56:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-02-15 10:56:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:56:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-02-15 10:56:43,649 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-02-15 10:56:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:43,650 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-02-15 10:56:43,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-02-15 10:56:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:43,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:43,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:43,651 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-15 10:56:43,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:43,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:43,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:43,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:56:43,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:56:43,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:56:43,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:56:43,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:56:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:56:43,693 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-02-15 10:56:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:43,792 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-02-15 10:56:43,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:56:43,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:56:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:43,794 INFO L225 Difference]: With dead ends: 41 [2019-02-15 10:56:43,794 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 10:56:43,795 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-02-15 10:56:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 10:56:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-02-15 10:56:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 10:56:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-02-15 10:56:43,804 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-02-15 10:56:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:43,804 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-02-15 10:56:43,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:56:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-02-15 10:56:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:43,805 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:43,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:43,805 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-02-15 10:56:43,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:43,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:43,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:43,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:43,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:43,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:43,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:43,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:43,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:43,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:43,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:43,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:56:43,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:43,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:43,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:43,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:43,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:43,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:43,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:43,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:56:43,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:43,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:56:44,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:56:44,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:56:44,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:56:44,185 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,201 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,215 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:44,260 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 10:56:44,511 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-02-15 10:56:44,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:44,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,784 INFO L267 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-02-15 10:56:44,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:56:44,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,825 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:44,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-02-15 10:56:44,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:44,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-15 10:56:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:44,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:44,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:44,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:44,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:44,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:44,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:44,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:44,919 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-02-15 10:56:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:45,287 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-02-15 10:56:45,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:45,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:45,289 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:56:45,289 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:56:45,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:56:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-02-15 10:56:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 10:56:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-02-15 10:56:45,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-02-15 10:56:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:45,300 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-02-15 10:56:45,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-02-15 10:56:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:45,301 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:45,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:45,301 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:45,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-15 10:56:45,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:45,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:45,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:45,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:45,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:45,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:45,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:45,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:45,582 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-15 10:56:45,583 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:45,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:45,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:45,588 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:45,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:45,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:45,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:45,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:45,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:45,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:45,769 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-15 10:56:45,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:45,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:46,050 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 10:56:46,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:46,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:46,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:46,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:46,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:46,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:46,206 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:46,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,224 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,238 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,249 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:46,279 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:46,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:56:46,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,336 INFO L267 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-02-15 10:56:46,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 10:56:46,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:56:46,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,393 INFO L267 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-02-15 10:56:46,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:56:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:46,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:46,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:46,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:56:46,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:46,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:56:46,444 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-02-15 10:56:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:46,812 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-02-15 10:56:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:56:46,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:46,813 INFO L225 Difference]: With dead ends: 61 [2019-02-15 10:56:46,814 INFO L226 Difference]: Without dead ends: 60 [2019-02-15 10:56:46,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-15 10:56:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-02-15 10:56:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 10:56:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-02-15 10:56:46,825 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-02-15 10:56:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:46,825 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-02-15 10:56:46,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-02-15 10:56:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:46,826 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:46,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:46,826 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-15 10:56:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:46,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:46,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:46,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:46,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:46,877 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:46,877 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-15 10:56:46,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:46,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:46,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:46,882 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:56:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:46,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:46,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:46,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:46,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:46,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:46,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:46,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:46,934 INFO L478 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 21 treesize of output 23 [2019-02-15 10:56:46,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:56:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:56:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:46,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:56:46,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:46,992 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:56:47,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,060 INFO L478 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 36 treesize of output 49 [2019-02-15 10:56:47,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,093 INFO L478 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 32 treesize of output 57 [2019-02-15 10:56:47,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:56:47,143 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,173 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:47,277 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 10:56:47,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:56:47,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:47,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 10:56:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:47,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:47,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:47,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:56:47,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:47,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:56:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:56:47,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:56:47,465 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-02-15 10:56:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:47,600 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-02-15 10:56:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:56:47,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:56:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:47,601 INFO L225 Difference]: With dead ends: 53 [2019-02-15 10:56:47,601 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 10:56:47,601 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-02-15 10:56:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 10:56:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-02-15 10:56:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:56:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-02-15 10:56:47,613 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-02-15 10:56:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:47,613 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-02-15 10:56:47,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:56:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-02-15 10:56:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:56:47,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:47,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:56:47,614 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-15 10:56:47,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:47,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:47,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:47,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:47,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:47,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:56:47,771 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-15 10:56:47,772 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:47,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:47,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:47,776 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:47,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:47,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:47,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:47,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:47,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:47,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:47,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:47,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:47,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:47,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:56:47,854 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:56:47,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:47,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:56:48,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:56:48,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:56:48,084 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,113 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,135 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,157 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:48,233 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 10:56:48,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:48,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,308 INFO L267 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-02-15 10:56:48,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:56:48,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:56:48,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:48,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 10:56:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:48,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:48,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:48,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:48,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:48,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:48,493 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-02-15 10:56:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:49,012 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-02-15 10:56:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:49,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:56:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:49,015 INFO L225 Difference]: With dead ends: 69 [2019-02-15 10:56:49,015 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 10:56:49,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 10:56:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-02-15 10:56:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 10:56:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-02-15 10:56:49,027 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-02-15 10:56:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:49,027 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-02-15 10:56:49,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-02-15 10:56:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:56:49,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:49,028 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 10:56:49,028 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-02-15 10:56:49,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:49,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:49,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:49,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:49,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:49,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:49,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:49,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:49,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:49,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:56:49,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:49,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:49,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:49,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:49,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:49,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:56:49,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:56:49,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:56:49,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:56:49,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:56:49,615 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,630 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,645 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,661 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:49,710 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-02-15 10:56:49,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:56:49,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,805 INFO L267 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-02-15 10:56:49,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:56:49,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-02-15 10:56:49,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:49,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-02-15 10:56:49,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:49,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:56:49,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:49,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:49,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 10:56:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:49,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:50,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:50,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-15 10:56:50,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:50,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:56:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:56:50,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:56:50,008 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-02-15 10:56:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:50,345 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-02-15 10:56:50,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:50,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 10:56:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:50,346 INFO L225 Difference]: With dead ends: 73 [2019-02-15 10:56:50,346 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:56:50,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:56:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-02-15 10:56:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 10:56:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-02-15 10:56:50,358 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-02-15 10:56:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:50,358 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-02-15 10:56:50,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:56:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-02-15 10:56:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:56:50,359 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:50,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:56:50,360 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:50,360 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-15 10:56:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:50,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:50,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:50,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:50,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:50,466 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:56:50,467 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-15 10:56:50,467 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:50,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:50,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:50,470 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:50,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:50,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:50,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:50,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:50,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:50,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:50,533 INFO L478 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 21 treesize of output 23 [2019-02-15 10:56:50,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:56:50,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:56:50,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:56:50,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:56:50,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,670 INFO L478 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 36 treesize of output 49 [2019-02-15 10:56:50,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,764 INFO L478 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 32 treesize of output 57 [2019-02-15 10:56:50,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:56:50,812 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,826 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,840 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,856 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:50,885 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:56:50,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:50,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 10:56:50,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:50,955 INFO L267 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-02-15 10:56:50,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:56:51,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:51,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:51,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:51,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:51,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:51,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:51,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:51,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-15 10:56:51,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:51,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:51,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-02-15 10:56:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:51,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:51,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:51,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:56:51,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:51,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:51,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:51,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:56:51,152 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-02-15 10:56:51,573 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-02-15 10:56:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:51,784 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-02-15 10:56:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:51,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:56:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:51,787 INFO L225 Difference]: With dead ends: 84 [2019-02-15 10:56:51,787 INFO L226 Difference]: Without dead ends: 78 [2019-02-15 10:56:51,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:56:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-15 10:56:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-02-15 10:56:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 10:56:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-02-15 10:56:51,802 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-02-15 10:56:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:51,803 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-02-15 10:56:51,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-02-15 10:56:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:56:51,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:51,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:56:51,804 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-15 10:56:51,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:51,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:51,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:51,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:51,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:51,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:51,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:56:51,958 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-15 10:56:51,960 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:51,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:51,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:51,964 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:56:51,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:51,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:51,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:51,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:51,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:51,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:51,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:51,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:51,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:52,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:52,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:52,107 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:52,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:52,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:52,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:52,263 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,273 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:52,326 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:52,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-15 10:56:52,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:56:52,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:56:52,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-02-15 10:56:52,945 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-02-15 10:56:52,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:53,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:53,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:53,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:53,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:53,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:53,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:53,236 INFO L303 Elim1Store]: Index analysis took 286 ms [2019-02-15 10:56:53,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 10:56:53,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 10:56:54,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,567 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:54,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-15 10:56:54,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-15 10:56:54,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-02-15 10:56:54,934 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-02-15 10:56:54,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:54,949 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:54,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-02-15 10:56:54,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-15 10:56:55,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,138 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:55,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-15 10:56:55,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,223 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:55,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-15 10:56:55,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-15 10:56:55,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-02-15 10:56:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:55,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:55,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:56:55,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:55,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:56:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:56:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:56:55,479 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-02-15 10:56:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:56,285 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-02-15 10:56:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:56:56,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:56:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:56,287 INFO L225 Difference]: With dead ends: 109 [2019-02-15 10:56:56,287 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 10:56:56,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:56:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 10:56:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-02-15 10:56:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 10:56:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-02-15 10:56:56,306 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-02-15 10:56:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:56,306 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-02-15 10:56:56,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:56:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-02-15 10:56:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:56:56,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:56,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:56:56,308 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:56,308 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-15 10:56:56,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:56,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:56,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:56,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:56,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:56,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:56:56,370 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-15 10:56:56,371 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:56,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:56,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:56,376 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:56,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:56,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:56,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:56,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:56,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:56,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:56,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:56,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:56,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:56,442 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:56,443 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:56,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:56,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:56,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,586 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:56,681 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:56:56,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:56:56,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,734 INFO L267 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-02-15 10:56:56,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:56:56,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:56:56,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,783 INFO L267 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-02-15 10:56:56,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:56:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:56,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:56,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:56,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:56,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:56,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:56,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:56,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:56,864 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-02-15 10:56:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:57,198 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-02-15 10:56:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:57,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:56:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:57,200 INFO L225 Difference]: With dead ends: 77 [2019-02-15 10:56:57,200 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 10:56:57,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:56:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 10:56:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-15 10:56:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 10:56:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-02-15 10:56:57,219 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-02-15 10:56:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:57,219 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-02-15 10:56:57,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-02-15 10:56:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:56:57,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:57,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:56:57,221 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-02-15 10:56:57,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:57,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:57,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:57,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:57,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:57,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:57,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:57,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:57,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:57,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:57,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:57,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:56:57,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:57,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:56:57,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:56:57,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:56:57,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:56:57,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:57,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:57,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:57,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:57,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:56:57,595 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,617 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,653 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:57,683 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 10:56:57,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:56:57,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,741 INFO L267 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-02-15 10:56:57,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:56:57,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,771 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:57,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 10:56:57,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,804 INFO L267 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-02-15 10:56:57,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-02-15 10:56:57,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:57,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-15 10:56:57,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:57,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:57,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 10:56:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:57,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:57,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:57,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:56:57,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:57,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:56:57,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:56:57,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:57,978 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-02-15 10:56:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:58,613 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-02-15 10:56:58,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:58,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:56:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:58,617 INFO L225 Difference]: With dead ends: 88 [2019-02-15 10:56:58,617 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 10:56:58,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:56:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 10:56:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-02-15 10:56:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:56:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-15 10:56:58,635 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-15 10:56:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:58,636 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-15 10:56:58,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:56:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-15 10:56:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:56:58,636 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:58,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:56:58,637 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-15 10:56:58,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:58,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:58,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:58,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:58,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:58,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:58,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:58,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:56:58,699 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-15 10:56:58,700 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:58,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:58,703 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:58,704 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:58,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:58,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:58,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:58,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:58,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:58,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:58,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:58,750 INFO L478 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 21 treesize of output 23 [2019-02-15 10:56:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:56:58,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:56:58,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 10:56:58,802 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,819 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:56:58,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,881 INFO L478 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 22 treesize of output 38 [2019-02-15 10:56:58,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:56:58,914 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,926 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,935 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:58,954 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 10:56:58,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:58,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:56:58,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:58,996 INFO L267 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-02-15 10:56:58,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:56:59,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,016 INFO L478 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 28 treesize of output 50 [2019-02-15 10:56:59,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,155 INFO L267 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-02-15 10:56:59,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-15 10:56:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:59,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:59,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:59,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:56:59,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:59,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:59,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:56:59,214 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-02-15 10:56:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:59,474 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-02-15 10:56:59,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:59,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:56:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:59,476 INFO L225 Difference]: With dead ends: 81 [2019-02-15 10:56:59,476 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 10:56:59,476 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-02-15 10:56:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 10:56:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-02-15 10:56:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:56:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-15 10:56:59,492 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-15 10:56:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:59,492 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-15 10:56:59,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-15 10:56:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:56:59,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:59,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:56:59,493 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-15 10:56:59,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:59,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:59,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:59,713 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-02-15 10:56:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:59,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:59,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:59,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:56:59,772 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-15 10:56:59,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:59,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:59,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:59,776 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:56:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:59,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:59,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:59,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:59,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:59,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:59,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:59,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:56:59,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:56:59,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:59,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:56:59,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:59,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:56:59,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:59,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:59,918 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:59,918 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,935 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,948 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:59,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:59,990 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:00,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:57:00,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,052 INFO L267 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-02-15 10:57:00,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:57:00,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:57:00,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,103 INFO L267 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-02-15 10:57:00,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:57:00,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,127 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:00,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 10:57:00,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,152 INFO L267 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-02-15 10:57:00,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:57:00,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-02-15 10:57:00,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:00,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:00,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:57:00,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:00,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:00,259 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-02-15 10:57:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:00,740 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-02-15 10:57:00,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:00,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:57:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:00,742 INFO L225 Difference]: With dead ends: 113 [2019-02-15 10:57:00,743 INFO L226 Difference]: Without dead ends: 112 [2019-02-15 10:57:00,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:57:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-15 10:57:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-02-15 10:57:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-15 10:57:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-02-15 10:57:00,766 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-02-15 10:57:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:00,766 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-02-15 10:57:00,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-02-15 10:57:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:00,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:00,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:00,767 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-02-15 10:57:00,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:00,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:00,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:00,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:00,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:00,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:00,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:00,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:00,891 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-02-15 10:57:00,897 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:00,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:00,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:00,900 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:00,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:00,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:00,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:00,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:00,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:00,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:00,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:00,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:00,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:00,984 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:00,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:57:01,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:01,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:57:01,131 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,149 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:01,172 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:01,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:57:01,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:57:01,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-15 10:57:01,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-02-15 10:57:01,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2019-02-15 10:57:01,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,583 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:01,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-15 10:57:01,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 10:57:01,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 10:57:01,710 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:96 [2019-02-15 10:57:01,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-15 10:57:01,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,957 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:01,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-02-15 10:57:01,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:02,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:02,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-02-15 10:57:02,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:02,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 10:57:02,070 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-02-15 10:57:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:02,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:02,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:02,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-15 10:57:02,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:02,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:02,167 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-02-15 10:57:02,769 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-02-15 10:57:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:03,193 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-02-15 10:57:03,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:57:03,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:57:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:03,196 INFO L225 Difference]: With dead ends: 137 [2019-02-15 10:57:03,196 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 10:57:03,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:57:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 10:57:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-15 10:57:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 10:57:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-02-15 10:57:03,228 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-02-15 10:57:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:03,228 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-02-15 10:57:03,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-02-15 10:57:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:03,229 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:03,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:03,230 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-15 10:57:03,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:03,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:03,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:03,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:03,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:03,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:03,345 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-15 10:57:03,346 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:03,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:03,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:03,349 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:03,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:03,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:03,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:03,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:03,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:03,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:03,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:03,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:03,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:03,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:03,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:03,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:03,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:03,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:57:03,682 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,706 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,720 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:03,771 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 10:57:03,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:03,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,872 INFO L267 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-02-15 10:57:03,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:03,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,897 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:03,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:57:03,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:03,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-15 10:57:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:03,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:04,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:04,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:04,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:04,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:04,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:04,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:04,057 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-02-15 10:57:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:04,365 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-02-15 10:57:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:04,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:57:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:04,367 INFO L225 Difference]: With dead ends: 120 [2019-02-15 10:57:04,367 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 10:57:04,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 10:57:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-02-15 10:57:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 10:57:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-02-15 10:57:04,409 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-02-15 10:57:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:04,410 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-02-15 10:57:04,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-02-15 10:57:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:04,410 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:04,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:04,411 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-15 10:57:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:04,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:04,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:04,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:04,624 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:57:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:04,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:04,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:04,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:04,764 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-15 10:57:04,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:04,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:04,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:04,774 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:04,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:04,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:04,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:04,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:04,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:04,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:04,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:04,871 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:04,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:04,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:04,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:04,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:05,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,028 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:05,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,070 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:05,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:05,117 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,131 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,144 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,185 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:05,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:57:05,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 10:57:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:05,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:05,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:05,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:57:05,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:05,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:05,392 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-02-15 10:57:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:05,543 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-02-15 10:57:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:05,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:57:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:05,545 INFO L225 Difference]: With dead ends: 105 [2019-02-15 10:57:05,545 INFO L226 Difference]: Without dead ends: 104 [2019-02-15 10:57:05,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-15 10:57:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-15 10:57:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 10:57:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-02-15 10:57:05,592 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-02-15 10:57:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:05,592 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-02-15 10:57:05,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-02-15 10:57:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:05,593 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:05,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:05,593 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-02-15 10:57:05,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:05,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:05,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:06,179 WARN L181 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-02-15 10:57:06,457 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-02-15 10:57:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:06,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:06,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:06,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:06,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:06,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:06,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:06,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:57:06,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:57:06,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:57:06,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:06,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:06,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:06,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:06,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:06,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:06,533 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:06,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,552 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:57:06,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:06,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:57:06,745 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,755 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,763 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:06,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:06,784 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:06,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:06,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:57:06,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:57:06,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-15 10:57:06,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:231 [2019-02-15 10:57:07,141 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-02-15 10:57:07,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2019-02-15 10:57:07,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,276 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:07,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-15 10:57:07,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 10:57:07,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 10:57:07,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-15 10:57:07,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:197, output treesize:121 [2019-02-15 10:57:07,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,622 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:07,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-15 10:57:07,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,722 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:07,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 10:57:07,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-15 10:57:07,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,901 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:07,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-15 10:57:07,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-15 10:57:07,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-15 10:57:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:08,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:08,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:08,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:57:08,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:08,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:08,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:08,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:08,094 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-02-15 10:57:08,494 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-02-15 10:57:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:08,798 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-02-15 10:57:08,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:08,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:57:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:08,801 INFO L225 Difference]: With dead ends: 131 [2019-02-15 10:57:08,801 INFO L226 Difference]: Without dead ends: 130 [2019-02-15 10:57:08,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:57:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-15 10:57:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-02-15 10:57:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:57:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-02-15 10:57:08,822 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-02-15 10:57:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:08,822 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-02-15 10:57:08,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-02-15 10:57:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:08,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:08,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:08,823 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-15 10:57:08,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:08,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:08,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:09,055 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-02-15 10:57:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:09,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:09,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:09,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:09,071 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-15 10:57:09,072 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:09,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:09,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:09,076 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:09,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:09,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:09,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:09,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:09,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:09,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:09,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:09,104 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:09,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:09,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:09,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:09,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,160 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:09,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,232 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:09,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,265 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:09,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:09,312 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,325 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,338 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,354 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:09,382 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:09,580 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 10:57:09,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:57:09,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,616 INFO L267 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-02-15 10:57:09,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:57:09,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,689 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:09,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-02-15 10:57:09,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:09,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 10:57:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:09,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:09,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:09,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:09,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:09,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:09,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:09,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:09,780 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-02-15 10:57:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:10,253 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-02-15 10:57:10,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:10,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:57:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:10,255 INFO L225 Difference]: With dead ends: 71 [2019-02-15 10:57:10,255 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 10:57:10,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 10:57:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-02-15 10:57:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 10:57:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-02-15 10:57:10,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-02-15 10:57:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:10,278 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-02-15 10:57:10,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-02-15 10:57:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:10,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:10,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:10,279 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-15 10:57:10,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:10,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:10,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:10,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:10,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:10,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:10,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:10,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:10,378 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-15 10:57:10,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:10,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:10,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:10,383 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:10,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:10,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:10,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:10,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:10,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:10,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:10,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:57:10,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:10,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:57:10,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:10,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:10,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:10,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:10,529 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:10,529 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,545 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,559 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:10,600 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:10,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:57:10,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,643 INFO L267 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-02-15 10:57:10,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 10:57:10,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:57:10,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,687 INFO L267 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-02-15 10:57:10,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 10:57:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:10,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:10,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:10,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:10,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:10,733 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-02-15 10:57:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:10,992 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-02-15 10:57:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:10,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:57:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:10,994 INFO L225 Difference]: With dead ends: 73 [2019-02-15 10:57:10,994 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 10:57:10,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 10:57:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-02-15 10:57:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:57:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-02-15 10:57:11,026 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-02-15 10:57:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:11,027 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-02-15 10:57:11,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-02-15 10:57:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:11,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:11,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:11,027 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-15 10:57:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:11,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:11,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:11,170 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-15 10:57:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:11,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:11,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:11,199 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:11,199 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-15 10:57:11,201 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:11,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:11,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:11,204 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:11,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:11,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:11,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:11,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:11,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:11,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:11,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:11,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:11,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:11,283 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:11,284 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:57:11,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:11,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:57:11,431 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,441 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:11,472 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:11,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:57:11,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,531 INFO L267 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-02-15 10:57:11,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:57:11,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:11,555 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:11,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:57:11,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,577 INFO L267 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-02-15 10:57:11,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 10:57:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:11,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:11,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:11,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-15 10:57:11,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:11,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:57:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:57:11,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:11,641 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-02-15 10:57:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:11,872 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-15 10:57:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:11,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 10:57:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:11,874 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:57:11,874 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:57:11,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:57:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-02-15 10:57:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 10:57:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-02-15 10:57:11,901 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-02-15 10:57:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:11,901 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-02-15 10:57:11,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:57:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-02-15 10:57:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:11,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:11,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:11,902 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-15 10:57:11,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:11,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:11,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:11,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:11,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:11,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:11,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:57:11,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:11,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:11,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:11,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:57:11,995 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-02-15 10:57:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:12,060 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-02-15 10:57:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:12,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:57:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:12,062 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:57:12,062 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 10:57:12,063 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-02-15 10:57:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 10:57:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-02-15 10:57:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:57:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-02-15 10:57:12,102 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-02-15 10:57:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:12,102 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-02-15 10:57:12,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-02-15 10:57:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:12,102 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:12,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:12,103 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-02-15 10:57:12,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:12,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:12,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:12,322 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-15 10:57:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:12,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:12,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:12,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:12,510 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-15 10:57:12,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:12,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:12,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:12,514 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:12,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:12,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:12,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:12,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:12,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:12,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:12,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:57:12,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,580 INFO L478 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 22 treesize of output 38 [2019-02-15 10:57:12,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:57:12,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:12,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:57:12,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:12,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:12,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 10:57:12,667 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,684 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,716 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:12,737 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 10:57:12,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,812 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:57:12,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:12,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:57:12,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-02-15 10:57:12,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:12,902 INFO L478 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 28 treesize of output 50 [2019-02-15 10:57:12,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:12,919 INFO L267 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-02-15 10:57:12,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-15 10:57:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:12,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:12,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:12,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:12,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:12,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:12,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:12,962 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-02-15 10:57:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:13,201 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-02-15 10:57:13,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:13,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:57:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:13,202 INFO L225 Difference]: With dead ends: 83 [2019-02-15 10:57:13,203 INFO L226 Difference]: Without dead ends: 82 [2019-02-15 10:57:13,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-15 10:57:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-15 10:57:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 10:57:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-02-15 10:57:13,247 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-02-15 10:57:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:13,247 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-02-15 10:57:13,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-02-15 10:57:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:13,248 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:13,248 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:57:13,248 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-02-15 10:57:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:13,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:13,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:13,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:13,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:13,371 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-15 10:57:13,371 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:13,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:13,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:13,374 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:13,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:13,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:13,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:13,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:13,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:13,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:13,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:57:13,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,420 INFO L478 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 22 treesize of output 38 [2019-02-15 10:57:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:57:13,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:13,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:57:13,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:13,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:13,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 10:57:13,519 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,535 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,547 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,555 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:13,583 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 10:57:13,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:57:13,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,618 INFO L267 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-02-15 10:57:13,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:57:13,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,650 INFO L478 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 28 treesize of output 40 [2019-02-15 10:57:13,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,668 INFO L267 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-02-15 10:57:13,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-02-15 10:57:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:13,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:13,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:13,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:13,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:13,769 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-02-15 10:57:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:14,247 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-02-15 10:57:14,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:14,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:57:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:14,249 INFO L225 Difference]: With dead ends: 86 [2019-02-15 10:57:14,249 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:57:14,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:57:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-02-15 10:57:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 10:57:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-02-15 10:57:14,308 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-02-15 10:57:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:14,309 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-02-15 10:57:14,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-02-15 10:57:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:14,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:14,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:14,310 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-15 10:57:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:14,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:14,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:14,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:14,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:14,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:14,380 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-15 10:57:14,381 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:14,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:14,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:14,384 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:14,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:14,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:14,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:14,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:14,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:14,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:14,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:14,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:14,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:14,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,574 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:14,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:14,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:14,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:14,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:57:14,625 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,655 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,669 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,680 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:14,720 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 10:57:14,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:57:14,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,919 INFO L267 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-02-15 10:57:14,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:14,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:57:14,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:14,980 INFO L267 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-02-15 10:57:14,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 10:57:15,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,014 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:15,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:57:15,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:15,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 10:57:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:15,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:15,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:15,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:57:15,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:15,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:15,212 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-02-15 10:57:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:15,763 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-02-15 10:57:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:15,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:57:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:15,764 INFO L225 Difference]: With dead ends: 100 [2019-02-15 10:57:15,765 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 10:57:15,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:57:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 10:57:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-02-15 10:57:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 10:57:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-02-15 10:57:15,835 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-02-15 10:57:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:15,835 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-02-15 10:57:15,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-02-15 10:57:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:15,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:15,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:15,836 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-15 10:57:15,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:15,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:15,995 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:57:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:16,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:16,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:16,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:16,043 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-15 10:57:16,045 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:16,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:16,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:16,047 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:16,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:16,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:16,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:16,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:16,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:16,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:16,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:16,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,087 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:16,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,127 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:16,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:16,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:16,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:57:16,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:16,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:16,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:16,285 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,306 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,317 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,327 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:16,365 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:16,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:57:16,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,427 INFO L267 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-02-15 10:57:16,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:57:16,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:57:16,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,472 INFO L267 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-02-15 10:57:16,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:57:16,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,499 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:16,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:57:16,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,523 INFO L267 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-02-15 10:57:16,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:57:16,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-02-15 10:57:16,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:16,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:16,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:57:16,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:16,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:16,598 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-02-15 10:57:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:17,067 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-02-15 10:57:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:17,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:57:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:17,069 INFO L225 Difference]: With dead ends: 104 [2019-02-15 10:57:17,070 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 10:57:17,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:57:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 10:57:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-02-15 10:57:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 10:57:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-15 10:57:17,173 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-15 10:57:17,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:17,173 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-15 10:57:17,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-15 10:57:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:17,174 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:17,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:17,174 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-15 10:57:17,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:17,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:17,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:17,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:17,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:17,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:17,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:17,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:17,269 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-15 10:57:17,270 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:17,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:17,272 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:17,272 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:17,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:17,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:17,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:17,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:17,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:17,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:17,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:57:17,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:17,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:57:17,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:17,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:17,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:17,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:17,407 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:17,408 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,424 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,437 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:17,479 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:17,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:57:17,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,539 INFO L267 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-02-15 10:57:17,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:57:17,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:57:17,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,586 INFO L267 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-02-15 10:57:17,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:57:17,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,615 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:17,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:57:17,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,641 INFO L267 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-02-15 10:57:17,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:57:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:17,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:17,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:17,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:57:17,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:17,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:17,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:17,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:17,713 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-02-15 10:57:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:18,269 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-02-15 10:57:18,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:18,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:57:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:18,271 INFO L225 Difference]: With dead ends: 107 [2019-02-15 10:57:18,271 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 10:57:18,272 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-02-15 10:57:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 10:57:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-02-15 10:57:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 10:57:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-15 10:57:18,376 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-15 10:57:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:18,376 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-15 10:57:18,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-15 10:57:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:18,377 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:18,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:18,377 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-02-15 10:57:18,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:18,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:18,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:18,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:18,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:18,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:18,429 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-15 10:57:18,431 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:18,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:18,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:18,434 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:18,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:18,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:18,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:18,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:18,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:18,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:18,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:18,476 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:18,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:18,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:18,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:18,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,595 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:18,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,630 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:18,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:18,677 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,692 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,706 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,721 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:18,750 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:18,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:57:18,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,850 INFO L267 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-02-15 10:57:18,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:57:18,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:18,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:18,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:18,928 INFO L267 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-02-15 10:57:18,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 10:57:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:18,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:19,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:19,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:19,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:19,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:19,024 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-02-15 10:57:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:19,427 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-02-15 10:57:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:19,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:57:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:19,429 INFO L225 Difference]: With dead ends: 100 [2019-02-15 10:57:19,429 INFO L226 Difference]: Without dead ends: 98 [2019-02-15 10:57:19,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-15 10:57:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-02-15 10:57:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 10:57:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-02-15 10:57:19,531 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-02-15 10:57:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:19,531 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-02-15 10:57:19,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-02-15 10:57:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:19,531 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:19,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:19,532 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:19,532 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-15 10:57:19,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:19,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:19,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:19,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:19,692 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-02-15 10:57:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:19,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:19,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:19,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:19,710 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-15 10:57:19,711 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:19,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:19,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:19,713 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:19,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:19,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:19,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:19,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:19,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:19,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:19,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:57:19,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:19,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:19,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:19,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:19,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:19,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:19,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:19,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:57:19,807 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:19,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:19,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:19,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:19,861 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:19,862 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,878 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,892 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,903 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:19,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:19,934 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:19,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:57:20,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:57:20,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-15 10:57:20,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-02-15 10:57:20,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2019-02-15 10:57:20,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,360 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:20,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 10:57:20,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,434 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:20,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-15 10:57:20,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 10:57:20,488 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-02-15 10:57:20,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2019-02-15 10:57:20,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,620 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:20,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-15 10:57:20,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2019-02-15 10:57:20,678 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 10:57:20,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-02-15 10:57:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:20,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:20,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:20,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:57:20,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:20,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:20,855 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-02-15 10:57:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:21,786 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-15 10:57:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:21,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:57:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:21,787 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:57:21,787 INFO L226 Difference]: Without dead ends: 123 [2019-02-15 10:57:21,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:57:21,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-15 10:57:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-02-15 10:57:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 10:57:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-02-15 10:57:21,907 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-02-15 10:57:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:21,907 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-02-15 10:57:21,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-02-15 10:57:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:21,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:21,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:21,908 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-15 10:57:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:21,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:22,069 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:57:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:22,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:22,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:22,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:22,138 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-15 10:57:22,139 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:22,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:22,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:22,142 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:22,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:22,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:22,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:22,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:22,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:22,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:22,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:22,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:22,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:22,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:22,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:57:22,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:22,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:22,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:22,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:22,406 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,422 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,438 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,452 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:22,481 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 10:57:22,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:22,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,539 INFO L267 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-02-15 10:57:22,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:22,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,721 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:22,721 INFO L303 Elim1Store]: Index analysis took 160 ms [2019-02-15 10:57:22,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:57:22,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,754 INFO L267 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-02-15 10:57:22,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 10:57:22,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:22,786 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:22,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:57:22,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:22,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:22,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:22,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:22,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:22,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:57:22,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:22,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:57:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:57:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:22,901 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-02-15 10:57:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:23,433 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-02-15 10:57:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:23,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:57:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:23,435 INFO L225 Difference]: With dead ends: 114 [2019-02-15 10:57:23,435 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 10:57:23,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:57:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 10:57:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-02-15 10:57:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 10:57:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-02-15 10:57:23,578 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-02-15 10:57:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:23,578 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-02-15 10:57:23,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:57:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-02-15 10:57:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:23,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:23,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:23,579 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-02-15 10:57:23,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:23,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:23,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:23,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:23,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:23,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:23,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:23,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:23,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:23,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:23,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:23,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:23,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:23,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:57:23,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:23,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:23,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:23,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:23,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:23,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:23,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:57:23,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,769 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:23,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:23,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:23,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:23,993 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:24,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:24,041 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:24,060 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:24,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:24,103 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 10:57:24,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:24,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:24,172 INFO L267 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-02-15 10:57:24,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:24,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:24,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:24,235 INFO L267 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-02-15 10:57:24,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 10:57:24,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:24,264 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:24,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:57:24,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:24,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:24,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 10:57:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:24,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:24,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:24,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:57:24,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:24,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:24,361 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-02-15 10:57:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:24,925 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-02-15 10:57:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:57:24,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:57:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:24,927 INFO L225 Difference]: With dead ends: 164 [2019-02-15 10:57:24,927 INFO L226 Difference]: Without dead ends: 163 [2019-02-15 10:57:24,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-15 10:57:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-02-15 10:57:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-15 10:57:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-02-15 10:57:25,130 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-02-15 10:57:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:25,130 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-02-15 10:57:25,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-02-15 10:57:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:25,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:25,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:25,131 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-02-15 10:57:25,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:25,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:25,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:25,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:25,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:25,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:25,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:25,183 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-15 10:57:25,183 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:25,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:25,185 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:25,185 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:25,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:25,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:25,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:25,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:25,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:25,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:25,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:25,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,229 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:25,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,274 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:25,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:25,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:25,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:57:25,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:25,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:25,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:25,395 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,415 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,427 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,437 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,446 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:25,474 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:25,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:57:25,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,524 INFO L267 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-02-15 10:57:25,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:57:25,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:25,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:25,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 10:57:25,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 10:57:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:25,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:25,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:25,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:25,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:25,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:25,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:25,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:25,729 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-02-15 10:57:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:26,211 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-02-15 10:57:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:26,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:57:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:26,213 INFO L225 Difference]: With dead ends: 160 [2019-02-15 10:57:26,213 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 10:57:26,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 10:57:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-02-15 10:57:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-15 10:57:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-02-15 10:57:26,585 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-02-15 10:57:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:26,586 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-02-15 10:57:26,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-02-15 10:57:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:26,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:26,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:26,587 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-02-15 10:57:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:26,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:26,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:26,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:26,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:26,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:26,660 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-15 10:57:26,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:26,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:26,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:26,663 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:26,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:26,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:26,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:26,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:26,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:26,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:26,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:26,685 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:26,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:26,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:26,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 10:57:26,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,737 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:57:26,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,800 INFO L478 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 22 treesize of output 38 [2019-02-15 10:57:26,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:57:26,829 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,838 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,846 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,865 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 10:57:26,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:57:26,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,905 INFO L267 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-02-15 10:57:26,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:57:26,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,925 INFO L478 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 26 treesize of output 40 [2019-02-15 10:57:26,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,938 INFO L267 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-02-15 10:57:26,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-15 10:57:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:26,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:26,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:26,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:26,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:26,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:26,989 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-02-15 10:57:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:27,785 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-02-15 10:57:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:27,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:57:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:27,787 INFO L225 Difference]: With dead ends: 175 [2019-02-15 10:57:27,787 INFO L226 Difference]: Without dead ends: 174 [2019-02-15 10:57:27,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-15 10:57:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-02-15 10:57:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-15 10:57:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-15 10:57:28,021 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-15 10:57:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:28,021 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-15 10:57:28,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-15 10:57:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:28,022 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:28,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:28,022 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-15 10:57:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:28,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:28,173 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:57:28,494 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-02-15 10:57:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:57:28,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:28,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 10:57:28,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:28,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 10:57:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 10:57:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 10:57:28,600 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-02-15 10:57:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:28,956 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-02-15 10:57:28,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:28,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-15 10:57:28,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:28,958 INFO L225 Difference]: With dead ends: 185 [2019-02-15 10:57:28,958 INFO L226 Difference]: Without dead ends: 184 [2019-02-15 10:57:28,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-15 10:57:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-15 10:57:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-02-15 10:57:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-15 10:57:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-15 10:57:29,190 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-15 10:57:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:29,190 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-15 10:57:29,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 10:57:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-15 10:57:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:29,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:29,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:29,191 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-02-15 10:57:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:29,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:29,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:29,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:29,277 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-15 10:57:29,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:29,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:29,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:29,281 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:29,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:29,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:29,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:29,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:29,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:29,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:29,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:57:29,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,328 INFO L478 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 22 treesize of output 38 [2019-02-15 10:57:29,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:57:29,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:29,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:57:29,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:29,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:29,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 10:57:29,429 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,446 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,459 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,486 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:29,503 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 10:57:29,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:57:29,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,544 INFO L267 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-02-15 10:57:29,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:57:29,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,564 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:29,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-15 10:57:29,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:29,576 INFO L267 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-02-15 10:57:29,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:57:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:29,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:29,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:29,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:29,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:29,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:29,629 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-02-15 10:57:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:30,093 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-02-15 10:57:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:30,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:57:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:30,096 INFO L225 Difference]: With dead ends: 142 [2019-02-15 10:57:30,096 INFO L226 Difference]: Without dead ends: 141 [2019-02-15 10:57:30,096 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-02-15 10:57:30,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-15 10:57:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-02-15 10:57:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-15 10:57:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-02-15 10:57:30,331 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-02-15 10:57:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:30,331 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-02-15 10:57:30,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-02-15 10:57:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:30,332 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:30,332 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:57:30,332 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-02-15 10:57:30,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:30,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:30,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:30,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:30,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:30,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:30,515 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-15 10:57:30,515 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:30,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:30,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:30,518 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:30,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:30,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:30,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:30,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:30,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:30,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:30,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:30,546 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:30,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:30,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:30,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:30,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:30,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,686 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:30,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,722 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:30,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:30,769 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,815 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:30,848 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:30,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:30,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:30,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 10:57:30,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-15 10:57:30,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:57:31,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,028 INFO L267 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-02-15 10:57:31,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-02-15 10:57:31,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 10:57:31,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,082 INFO L267 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-02-15 10:57:31,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:57:31,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-02-15 10:57:31,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:31,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:31,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-15 10:57:31,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:31,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:57:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:57:31,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:31,143 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-02-15 10:57:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:31,834 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-02-15 10:57:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:31,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:57:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:31,837 INFO L225 Difference]: With dead ends: 219 [2019-02-15 10:57:31,837 INFO L226 Difference]: Without dead ends: 216 [2019-02-15 10:57:31,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-15 10:57:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-02-15 10:57:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-15 10:57:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-02-15 10:57:32,144 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-02-15 10:57:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:32,144 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-02-15 10:57:32,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:57:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-02-15 10:57:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:32,145 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:32,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:32,145 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-02-15 10:57:32,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:32,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:32,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:32,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:32,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:32,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:32,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:32,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:32,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:57:32,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:57:32,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:57:32,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:32,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:32,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:57:32,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:32,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:57:32,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:32,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:32,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:32,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:32,367 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:32,368 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,384 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,398 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,409 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:32,440 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 10:57:32,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-15 10:57:32,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:32,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-15 10:57:32,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-02-15 10:57:32,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 10:57:32,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:32,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-02-15 10:57:32,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-15 10:57:32,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-02-15 10:57:32,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,862 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:32,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-02-15 10:57:32,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-02-15 10:57:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,061 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:33,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-15 10:57:33,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-15 10:57:33,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-15 10:57:33,257 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-02-15 10:57:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:33,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:33,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:33,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:57:33,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:33,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:33,421 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-02-15 10:57:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:34,583 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-02-15 10:57:34,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:34,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:57:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:34,586 INFO L225 Difference]: With dead ends: 218 [2019-02-15 10:57:34,586 INFO L226 Difference]: Without dead ends: 215 [2019-02-15 10:57:34,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:57:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-15 10:57:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-02-15 10:57:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-15 10:57:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-02-15 10:57:34,918 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-02-15 10:57:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:34,918 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-02-15 10:57:34,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-02-15 10:57:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:34,919 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:34,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:34,919 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-02-15 10:57:34,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:34,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:34,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:34,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:34,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:34,979 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:34,979 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-15 10:57:34,980 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:34,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:34,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:34,983 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:34,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:34,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:34,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:34,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:34,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:35,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:35,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,022 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:35,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,060 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:35,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:35,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:35,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:57:35,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:35,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:35,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:35,198 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,549 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,602 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,612 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:35,647 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:35,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:57:35,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,696 INFO L267 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-02-15 10:57:35,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:57:35,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-15 10:57:35,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:35,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-15 10:57:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:35,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:35,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:35,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:35,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:35,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:35,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:35,794 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-02-15 10:57:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:36,586 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-02-15 10:57:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:36,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:57:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:36,589 INFO L225 Difference]: With dead ends: 274 [2019-02-15 10:57:36,589 INFO L226 Difference]: Without dead ends: 269 [2019-02-15 10:57:36,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-15 10:57:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-02-15 10:57:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-15 10:57:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-02-15 10:57:37,066 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-02-15 10:57:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:37,067 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-02-15 10:57:37,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-02-15 10:57:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:57:37,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:37,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:57:37,068 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-02-15 10:57:37,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:37,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:37,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:37,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:37,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:37,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:37,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:57:37,175 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-15 10:57:37,176 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:37,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:37,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:37,178 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:37,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:37,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:37,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:37,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:37,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:37,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:37,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:37,206 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:37,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:37,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:37,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:37,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,363 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,401 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:37,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:37,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,461 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,476 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:37,520 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:37,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:57:37,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,569 INFO L267 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-02-15 10:57:37,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:57:37,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:37,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:37,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 10:57:37,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-15 10:57:37,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,774 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:37,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-02-15 10:57:37,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,797 INFO L267 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-02-15 10:57:37,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-15 10:57:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:37,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:37,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:37,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-15 10:57:37,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:37,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:37,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:37,851 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-02-15 10:57:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:39,377 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-02-15 10:57:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:57:39,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:57:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:39,382 INFO L225 Difference]: With dead ends: 480 [2019-02-15 10:57:39,382 INFO L226 Difference]: Without dead ends: 477 [2019-02-15 10:57:39,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:57:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-15 10:57:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-02-15 10:57:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-02-15 10:57:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-02-15 10:57:40,254 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-02-15 10:57:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:40,254 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-02-15 10:57:40,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-02-15 10:57:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:57:40,255 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:40,256 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 10:57:40,256 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-02-15 10:57:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:40,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:40,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:40,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:40,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:57:40,294 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-02-15 10:57:40,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:40,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:40,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:40,298 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:40,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:40,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:40,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:40,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:40,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:40,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:40,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:40,322 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:40,331 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-15 10:57:40,345 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 10:57:40,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-15 10:57:40,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:40,420 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-15 10:57:40,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,444 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 10:57:40,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 10:57:40,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,450 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-15 10:57:40,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-15 10:57:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:40,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:40,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:40,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-02-15 10:57:40,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:40,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 10:57:40,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 10:57:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:40,481 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-02-15 10:57:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:42,387 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-02-15 10:57:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:42,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-15 10:57:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:42,394 INFO L225 Difference]: With dead ends: 804 [2019-02-15 10:57:42,394 INFO L226 Difference]: Without dead ends: 800 [2019-02-15 10:57:42,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-02-15 10:57:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-02-15 10:57:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-02-15 10:57:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-02-15 10:57:44,377 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-02-15 10:57:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:44,377 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-02-15 10:57:44,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 10:57:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-02-15 10:57:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:57:44,380 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:44,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:44,380 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-15 10:57:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,565 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-15 10:57:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:44,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:44,661 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:57:44,661 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-15 10:57:44,661 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:44,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:44,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:44,664 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:57:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:44,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:44,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:44,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:44,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:44,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:44,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:57:44,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:57:44,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:57:44,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:44,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:44,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:44,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:44,984 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,000 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,059 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-15 10:57:45,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:57:45,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,124 INFO L267 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-02-15 10:57:45,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:45,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:57:45,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,189 INFO L267 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-02-15 10:57:45,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 10:57:45,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,226 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:45,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:57:45,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,262 INFO L267 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-02-15 10:57:45,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 10:57:45,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,320 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:45,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:57:45,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:45,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 10:57:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:45,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:45,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:45,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:57:45,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:45,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:57:45,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:57:45,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:57:45,465 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-02-15 10:57:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:50,047 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-02-15 10:57:50,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:50,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:57:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:50,054 INFO L225 Difference]: With dead ends: 821 [2019-02-15 10:57:50,054 INFO L226 Difference]: Without dead ends: 820 [2019-02-15 10:57:50,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:57:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-02-15 10:57:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-02-15 10:57:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-02-15 10:57:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-02-15 10:57:51,961 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-02-15 10:57:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:51,961 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-02-15 10:57:51,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:57:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-02-15 10:57:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:57:51,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:51,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:51,963 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:51,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-15 10:57:51,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:51,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:51,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:51,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:52,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:52,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:52,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:57:52,012 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-15 10:57:52,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:52,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:52,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:52,016 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:52,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:52,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:52,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:52,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:52,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:52,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:52,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-15 10:57:52,040 INFO L478 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 20 treesize of output 22 [2019-02-15 10:57:52,052 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-02-15 10:57:52,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-15 10:57:52,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:52,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:57:52,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-15 10:57:52,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 10:57:52,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:57:52,147 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,160 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,179 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:52,206 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-02-15 10:57:52,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-15 10:57:52,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-15 10:57:52,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:57:52,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,256 INFO L267 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-02-15 10:57:52,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-15 10:57:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:52,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:52,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:52,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:52,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:52,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:52,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:52,307 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-02-15 10:57:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:54,366 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-02-15 10:57:54,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:54,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:57:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:54,372 INFO L225 Difference]: With dead ends: 805 [2019-02-15 10:57:54,372 INFO L226 Difference]: Without dead ends: 804 [2019-02-15 10:57:54,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-02-15 10:57:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-02-15 10:57:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-02-15 10:57:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-02-15 10:57:56,398 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-02-15 10:57:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:56,398 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-02-15 10:57:56,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-02-15 10:57:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:57:56,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:56,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:56,401 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-02-15 10:57:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:56,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:56,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:56,563 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-02-15 10:57:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:56,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:56,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:56,610 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:57:56,610 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-15 10:57:56,611 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:56,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:56,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:56,616 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:56,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:56,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:56,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:56,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:56,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:56,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:56,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:56,635 INFO L478 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 21 treesize of output 23 [2019-02-15 10:57:56,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:57:56,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:57:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:57:56,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:57:56,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,765 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,800 INFO L478 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 32 treesize of output 57 [2019-02-15 10:57:56,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:57:56,853 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,881 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,897 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:56,925 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 10:57:56,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:57:56,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,987 INFO L267 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-02-15 10:57:56,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:57:57,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:57:57,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,037 INFO L267 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-02-15 10:57:57,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:57:57,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,064 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:57,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:57:57,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,089 INFO L267 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-02-15 10:57:57,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:57:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:57,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:57,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:57,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:57:57,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:57,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:57,170 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-02-15 10:58:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:00,021 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-02-15 10:58:00,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:58:00,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:58:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:00,031 INFO L225 Difference]: With dead ends: 1004 [2019-02-15 10:58:00,031 INFO L226 Difference]: Without dead ends: 1003 [2019-02-15 10:58:00,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:58:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-02-15 10:58:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-02-15 10:58:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-02-15 10:58:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-02-15 10:58:02,229 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-02-15 10:58:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:02,229 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-02-15 10:58:02,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-02-15 10:58:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:02,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:02,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:58:02,232 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-02-15 10:58:02,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:02,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:02,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:02,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:02,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:02,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:58:02,345 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-15 10:58:02,346 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:02,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:02,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:02,348 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:02,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:02,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:02,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:02,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:02,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:02,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:02,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:02,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:58:02,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,385 INFO L478 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 22 treesize of output 38 [2019-02-15 10:58:02,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:58:02,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:02,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:58:02,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:58:02,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:58:02,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 10:58:02,464 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,479 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,502 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:02,532 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 10:58:02,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,561 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-15 10:58:02,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,577 INFO L267 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-02-15 10:58:02,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-02-15 10:58:02,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:58:02,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:02,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 10:58:02,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-02-15 10:58:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:02,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:02,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:02,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 10:58:02,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:02,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:58:02,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:58:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:02,738 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-02-15 10:58:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:06,003 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-02-15 10:58:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:58:06,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 10:58:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:06,012 INFO L225 Difference]: With dead ends: 1213 [2019-02-15 10:58:06,013 INFO L226 Difference]: Without dead ends: 1212 [2019-02-15 10:58:06,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-02-15 10:58:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-02-15 10:58:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-02-15 10:58:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-02-15 10:58:08,890 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-02-15 10:58:08,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:08,890 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-02-15 10:58:08,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:58:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-02-15 10:58:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:08,893 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:08,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:58:08,893 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-02-15 10:58:08,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:08,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:08,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:08,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:08,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:09,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:09,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:09,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:58:09,066 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-15 10:58:09,067 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:09,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:09,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:09,069 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:58:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:09,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:09,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:09,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:09,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:09,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:09,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:09,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:09,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:58:09,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:58:09,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:58:09,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:58:09,139 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:09,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:09,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:09,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:58:09,351 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,368 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,384 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,402 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:09,435 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 10:58:09,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:58:09,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,494 INFO L267 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-02-15 10:58:09,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:09,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,562 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:09,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 10:58:09,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,594 INFO L267 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-02-15 10:58:09,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-02-15 10:58:09,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-15 10:58:09,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,660 INFO L267 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-02-15 10:58:09,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-02-15 10:58:09,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,695 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:09,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 10:58:09,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:09,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:58:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:09,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:09,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:09,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:58:09,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:09,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:58:09,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:58:09,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:58:09,825 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-02-15 10:58:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:14,235 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-02-15 10:58:14,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:58:14,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:58:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:14,251 INFO L225 Difference]: With dead ends: 1577 [2019-02-15 10:58:14,251 INFO L226 Difference]: Without dead ends: 1575 [2019-02-15 10:58:14,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:58:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-02-15 10:58:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-02-15 10:58:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-02-15 10:58:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-02-15 10:58:16,271 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-02-15 10:58:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:16,272 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-02-15 10:58:16,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:58:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-02-15 10:58:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:16,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:16,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:58:16,274 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-02-15 10:58:16,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:16,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:16,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:16,411 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:58:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:58:16,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:16,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:16,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:58:16,526 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-15 10:58:16,526 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:16,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:16,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:16,529 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:58:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:16,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:16,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:16,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:16,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:16,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:16,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:16,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:16,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:58:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:58:16,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:58:16,581 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:58:16,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,600 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:58:16,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:58:16,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:58:16,720 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,738 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:16,760 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 10:58:16,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:58:16,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,820 INFO L267 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-02-15 10:58:16,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:58:16,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,845 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:16,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:58:16,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,865 INFO L267 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-02-15 10:58:16,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-15 10:58:16,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 10:58:16,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,915 INFO L267 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-02-15 10:58:16,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 10:58:16,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,943 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:16,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:58:16,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,966 INFO L267 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-02-15 10:58:16,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 10:58:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:16,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:17,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:17,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 10:58:17,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:17,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:58:17,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:58:17,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:58:17,051 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-02-15 10:58:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:20,388 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-02-15 10:58:20,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:58:20,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:58:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:20,394 INFO L225 Difference]: With dead ends: 1108 [2019-02-15 10:58:20,395 INFO L226 Difference]: Without dead ends: 1107 [2019-02-15 10:58:20,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:58:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-02-15 10:58:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-02-15 10:58:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-02-15 10:58:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-02-15 10:58:23,235 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-02-15 10:58:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:23,236 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-02-15 10:58:23,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:58:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-02-15 10:58:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:23,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:23,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:58:23,238 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-02-15 10:58:23,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:23,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:23,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:58:23,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:23,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:23,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:58:23,317 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-15 10:58:23,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:23,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:23,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:23,320 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:23,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:23,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:23,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:23,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:23,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:23,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:23,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:23,350 INFO L478 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 21 treesize of output 23 [2019-02-15 10:58:23,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:58:23,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:58:23,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:58:23,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:58:23,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,488 INFO L478 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 36 treesize of output 49 [2019-02-15 10:58:23,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,527 INFO L478 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 32 treesize of output 57 [2019-02-15 10:58:23,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:58:23,574 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,602 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:23,647 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:58:23,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:58:23,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,702 INFO L267 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-02-15 10:58:23,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:58:23,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,728 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:23,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:58:23,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:23,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 10:58:23,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 10:58:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:23,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:23,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:23,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:23,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:23,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:23,903 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-02-15 10:58:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:26,957 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-02-15 10:58:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:26,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:58:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:26,962 INFO L225 Difference]: With dead ends: 1075 [2019-02-15 10:58:26,962 INFO L226 Difference]: Without dead ends: 1074 [2019-02-15 10:58:26,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-02-15 10:58:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-02-15 10:58:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-02-15 10:58:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-02-15 10:58:29,820 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-02-15 10:58:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:29,820 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-02-15 10:58:29,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-02-15 10:58:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:29,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:29,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:58:29,821 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-02-15 10:58:29,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:29,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:29,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:29,980 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:58:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:58:30,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:30,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:30,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:58:30,263 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-15 10:58:30,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:30,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:30,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:30,265 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:58:30,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:30,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:30,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:30,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:30,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:30,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:30,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:30,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:30,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:58:30,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:58:30,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:58:30,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:58:30,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:30,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:30,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:30,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:58:30,539 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,552 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,568 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:30,615 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 10:58:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:58:30,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,677 INFO L267 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-02-15 10:58:30,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,709 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:30,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:58:30,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,742 INFO L267 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-02-15 10:58:30,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 10:58:30,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:58:30,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,810 INFO L267 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-02-15 10:58:30,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-15 10:58:30,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:30,846 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:30,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:58:30,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:30,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:30,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 10:58:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:30,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:30,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:58:30,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:30,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:58:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:58:30,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:58:30,984 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-02-15 10:58:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:35,602 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-02-15 10:58:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:58:35,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:58:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:35,610 INFO L225 Difference]: With dead ends: 1522 [2019-02-15 10:58:35,610 INFO L226 Difference]: Without dead ends: 1521 [2019-02-15 10:58:35,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:58:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-02-15 10:58:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-02-15 10:58:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-02-15 10:58:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-02-15 10:58:38,728 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-02-15 10:58:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:38,729 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-02-15 10:58:38,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:58:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-02-15 10:58:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:38,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:38,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:58:38,731 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-15 10:58:38,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:38,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:38,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:38,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:38,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:38,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:58:38,756 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-15 10:58:38,757 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:38,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:38,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:38,760 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:38,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:38,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:38,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:38,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:38,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:38,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:38,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:38,781 INFO L478 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 21 treesize of output 23 [2019-02-15 10:58:38,791 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-15 10:58:38,804 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 10:58:38,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-15 10:58:38,824 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:38,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:38,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:38,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:38,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:38,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:38,870 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-15 10:58:38,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,875 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 10:58:38,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:38,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:38,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 10:58:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:38,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:38,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:58:38,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:58:38,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:58:38,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:58:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:58:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:58:38,917 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-02-15 10:58:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:42,937 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-02-15 10:58:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:58:42,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-15 10:58:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:42,945 INFO L225 Difference]: With dead ends: 1559 [2019-02-15 10:58:42,946 INFO L226 Difference]: Without dead ends: 1554 [2019-02-15 10:58:42,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:58:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-02-15 10:58:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-02-15 10:58:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-02-15 10:58:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-02-15 10:58:47,388 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-02-15 10:58:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:47,389 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-02-15 10:58:47,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:58:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-02-15 10:58:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:47,391 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:47,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:58:47,391 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-15 10:58:47,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:47,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:58:47,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:47,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:47,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:58:47,462 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-15 10:58:47,464 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:47,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:47,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:47,467 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:47,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:47,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:47,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:47,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:47,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:47,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:47,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:47,493 INFO L478 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 21 treesize of output 23 [2019-02-15 10:58:47,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:58:47,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:58:47,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:58:47,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,556 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:58:47,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,663 INFO L478 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 36 treesize of output 49 [2019-02-15 10:58:47,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,699 INFO L478 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 32 treesize of output 57 [2019-02-15 10:58:47,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:58:47,753 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,768 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,783 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,799 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:47,828 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:58:47,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:58:47,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:48,305 INFO L267 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-02-15 10:58:48,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:58:48,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:48,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:48,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:48,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:48,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:48,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:48,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:48,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:58:48,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:48,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 10:58:48,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 10:58:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:48,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:48,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:48,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:58:48,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:48,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:58:48,534 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-02-15 10:58:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:52,880 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-02-15 10:58:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:52,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:58:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:52,885 INFO L225 Difference]: With dead ends: 1574 [2019-02-15 10:58:52,885 INFO L226 Difference]: Without dead ends: 1570 [2019-02-15 10:58:52,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-02-15 10:58:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-02-15 10:58:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-02-15 10:58:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-02-15 10:58:57,163 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-02-15 10:58:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:57,163 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-02-15 10:58:57,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-02-15 10:58:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:58:57,165 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:57,165 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 10:58:57,165 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:57,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-02-15 10:58:57,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:57,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:57,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:58:57,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:57,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:57,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:58:57,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:58:57,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:57,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:57,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:58:57,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:58:57,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:58:57,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:58:57,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:57,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:58:57,254 INFO L478 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 21 treesize of output 23 [2019-02-15 10:58:57,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:58:57,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:58:57,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:58:57,289 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,314 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:58:57,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,381 INFO L478 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 36 treesize of output 49 [2019-02-15 10:58:57,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,415 INFO L478 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 32 treesize of output 57 [2019-02-15 10:58:57,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:58:57,459 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,473 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:57,528 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:58:57,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 10:58:57,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,582 INFO L267 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-02-15 10:58:57,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 10:58:57,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:58:57,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:57,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:58:57,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-15 10:58:57,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,759 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:57,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:58:57,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,840 INFO L267 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-02-15 10:58:57,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-02-15 10:58:57,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 10:58:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,895 INFO L267 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-02-15 10:58:57,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 10:58:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:57,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:57,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:58:57,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:57,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:58:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:58:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:58:57,981 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-02-15 10:59:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:04,004 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-02-15 10:59:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:59:04,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:59:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:04,009 INFO L225 Difference]: With dead ends: 2098 [2019-02-15 10:59:04,010 INFO L226 Difference]: Without dead ends: 2091 [2019-02-15 10:59:04,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:59:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-02-15 10:59:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-02-15 10:59:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-15 10:59:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-02-15 10:59:09,128 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-02-15 10:59:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:09,128 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-02-15 10:59:09,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:59:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-02-15 10:59:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:59:09,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:09,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:59:09,131 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-02-15 10:59:09,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:09,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:09,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:59:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:09,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:09,258 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:59:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:09,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:09,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:09,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:59:09,316 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-15 10:59:09,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:09,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:09,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:09,320 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:09,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:09,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:09,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:09,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:09,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:09,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:09,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:59:09,376 INFO L478 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 21 treesize of output 23 [2019-02-15 10:59:09,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:59:09,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:59:09,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:59:09,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:59:09,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,534 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:09,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,566 INFO L478 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 32 treesize of output 57 [2019-02-15 10:59:09,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:59:09,616 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,629 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,642 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,657 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:09,684 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:59:09,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:59:09,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,733 INFO L267 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-02-15 10:59:09,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:59:09,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,772 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:09,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:59:09,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,791 INFO L267 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-02-15 10:59:09,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 10:59:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:09,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:09,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:09,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:09,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:09,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:09,846 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-02-15 10:59:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:14,880 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-02-15 10:59:14,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:14,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:59:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:14,885 INFO L225 Difference]: With dead ends: 1846 [2019-02-15 10:59:14,885 INFO L226 Difference]: Without dead ends: 1839 [2019-02-15 10:59:14,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-02-15 10:59:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-02-15 10:59:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-15 10:59:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-02-15 10:59:20,074 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-02-15 10:59:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:20,075 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-02-15 10:59:20,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-02-15 10:59:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:59:20,077 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:20,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:59:20,077 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-02-15 10:59:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:20,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:20,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:59:20,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:20,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:20,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:59:20,206 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-15 10:59:20,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:20,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:20,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:20,210 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:20,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:20,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:20,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:20,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:20,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:20,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:59:20,238 INFO L478 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 21 treesize of output 23 [2019-02-15 10:59:20,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:59:20,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:59:20,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:59:20,261 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,286 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:59:20,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,357 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:20,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,390 INFO L478 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 32 treesize of output 57 [2019-02-15 10:59:20,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:59:20,432 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,447 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,460 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,475 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:20,502 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 10:59:20,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:59:20,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:20,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:59:20,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-02-15 10:59:20,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-02-15 10:59:20,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-02-15 10:59:20,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 10:59:20,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-02-15 10:59:20,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,886 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:20,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-15 10:59:20,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,947 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:20,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-02-15 10:59:20,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 10:59:21,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-15 10:59:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:21,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:21,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:21,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 10:59:21,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:21,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:59:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:59:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:21,194 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-02-15 10:59:22,985 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-02-15 10:59:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:28,013 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-02-15 10:59:28,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:59:28,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:59:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:28,019 INFO L225 Difference]: With dead ends: 2193 [2019-02-15 10:59:28,019 INFO L226 Difference]: Without dead ends: 2192 [2019-02-15 10:59:28,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:59:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-02-15 10:59:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-02-15 10:59:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-02-15 10:59:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-02-15 10:59:33,560 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-02-15 10:59:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:33,560 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-02-15 10:59:33,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:59:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-02-15 10:59:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:59:33,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:33,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:59:33,563 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-02-15 10:59:33,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:33,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:33,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:33,721 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:59:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:33,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:33,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:33,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:33,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:33,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:33,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:59:33,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:59:33,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:59:33,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:33,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:33,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:33,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:33,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:33,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:59:33,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:59:34,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:59:34,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:59:34,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:59:34,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:59:34,134 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,156 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,169 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,180 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:34,217 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 10:59:34,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:59:34,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,274 INFO L267 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-02-15 10:59:34,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:59:34,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:59:34,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,340 INFO L267 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-02-15 10:59:34,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-15 10:59:34,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,373 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:34,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:59:34,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,405 INFO L267 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-02-15 10:59:34,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 10:59:34,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,436 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:34,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:59:34,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:34,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 10:59:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:34,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:34,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:34,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:59:34,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:34,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:59:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:59:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:34,556 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-02-15 10:59:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:41,779 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-02-15 10:59:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:59:41,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:59:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:41,786 INFO L225 Difference]: With dead ends: 2526 [2019-02-15 10:59:41,786 INFO L226 Difference]: Without dead ends: 2520 [2019-02-15 10:59:41,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:59:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-02-15 10:59:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-02-15 10:59:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-02-15 10:59:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-02-15 10:59:47,452 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-02-15 10:59:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:47,452 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-02-15 10:59:47,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:59:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-02-15 10:59:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:59:47,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:47,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:59:47,455 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-02-15 10:59:47,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:47,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:59:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:47,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:47,636 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-02-15 10:59:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:59:47,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:47,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:47,713 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:59:47,713 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-02-15 10:59:47,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:47,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:47,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:47,716 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:47,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:47,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:47,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:47,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:47,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:47,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:59:47,738 INFO L478 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 21 treesize of output 23 [2019-02-15 10:59:47,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:59:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:59:47,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:59:47,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:59:47,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,861 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:47,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,895 INFO L478 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 32 treesize of output 57 [2019-02-15 10:59:47,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:59:47,940 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,967 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,982 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:48,009 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 10:59:48,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:59:48,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:48,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 10:59:48,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-15 10:59:48,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,245 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:48,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:59:48,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,269 INFO L267 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-02-15 10:59:48,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-02-15 10:59:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:48,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:48,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-15 10:59:48,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:48,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:59:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:59:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:59:48,353 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-02-15 10:59:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:53,921 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-02-15 10:59:53,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:53,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 10:59:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:53,926 INFO L225 Difference]: With dead ends: 1971 [2019-02-15 10:59:53,926 INFO L226 Difference]: Without dead ends: 1964 [2019-02-15 10:59:53,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:59:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-02-15 10:59:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-02-15 10:59:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-02-15 10:59:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-02-15 10:59:59,551 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-02-15 10:59:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:59,551 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-02-15 10:59:59,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:59:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-02-15 10:59:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:59:59,555 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:59,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:59:59,555 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:59,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-02-15 10:59:59,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:59,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:59,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:59,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:59:59,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:59,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:59,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:59,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:59,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:59,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:59,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:59:59,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:59:59,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:59:59,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:59,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:59,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:59:59,642 INFO L478 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 21 treesize of output 23 [2019-02-15 10:59:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 10:59:59,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 10:59:59,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 10:59:59,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 10:59:59,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,766 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:59,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,801 INFO L478 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 32 treesize of output 57 [2019-02-15 10:59:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 10:59:59,845 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,859 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,887 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:59,913 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 10:59:59,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:59:59,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:59,974 INFO L267 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-02-15 10:59:59,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:59:59,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:59,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:59:59,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,019 INFO L267 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-02-15 11:00:00,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:00:00,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,046 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:00,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 11:00:00,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,070 INFO L267 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-02-15 11:00:00,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:00:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:00,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:00,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:00,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:00:00,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:00,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:00:00,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:00:00,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:00,146 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-02-15 11:00:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:06,132 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-02-15 11:00:06,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:06,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 11:00:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:06,138 INFO L225 Difference]: With dead ends: 2036 [2019-02-15 11:00:06,138 INFO L226 Difference]: Without dead ends: 2033 [2019-02-15 11:00:06,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-02-15 11:00:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-02-15 11:00:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-02-15 11:00:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-02-15 11:00:11,959 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-02-15 11:00:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:11,959 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-02-15 11:00:11,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:00:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-02-15 11:00:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:00:11,962 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:11,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:00:11,962 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:11,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-02-15 11:00:11,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:11,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:11,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:12,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:12,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:12,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:12,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:12,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:12,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:12,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:00:12,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:00:12,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:00:12,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:12,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:12,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:00:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:00:12,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:00:12,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:00:12,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:00:12,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:00:12,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:00:12,207 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:00:12,208 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,236 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:12,275 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 11:00:12,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-15 11:00:12,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:12,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-02-15 11:00:12,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-02-15 11:00:12,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 11:00:12,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:00:12,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,623 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:12,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-15 11:00:12,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-15 11:00:12,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-02-15 11:00:12,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-15 11:00:12,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:00:12,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,002 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:13,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:00:13,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,079 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:13,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-02-15 11:00:13,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-15 11:00:13,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-02-15 11:00:13,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,211 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:13,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-02-15 11:00:13,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:00:13,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,367 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:13,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-15 11:00:13,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-02-15 11:00:13,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-15 11:00:13,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-02-15 11:00:16,894 WARN L181 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-02-15 11:00:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:16,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:17,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:17,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:00:17,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:17,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:00:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:00:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:17,034 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-02-15 11:00:19,524 WARN L181 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-02-15 11:00:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:26,736 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-02-15 11:00:26,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:00:26,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:00:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:26,744 INFO L225 Difference]: With dead ends: 2952 [2019-02-15 11:00:26,744 INFO L226 Difference]: Without dead ends: 2951 [2019-02-15 11:00:26,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:00:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-02-15 11:00:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-02-15 11:00:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-02-15 11:00:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-02-15 11:00:31,949 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-02-15 11:00:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:31,949 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-02-15 11:00:31,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:00:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-02-15 11:00:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:00:31,952 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:31,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:00:31,952 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-15 11:00:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:31,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:31,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:32,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:32,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:32,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:00:32,094 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-15 11:00:32,095 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:32,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:32,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:32,097 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:32,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:32,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:32,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:32,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:32,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:32,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:32,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:00:32,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,138 INFO L478 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 36 treesize of output 49 [2019-02-15 11:00:32,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,172 INFO L478 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 32 treesize of output 57 [2019-02-15 11:00:32,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:00:32,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:00:32,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:00:32,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:00:32,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:00:32,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:00:32,292 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,313 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,324 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,342 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:32,368 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:00:32,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:00:32,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:32,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:00:32,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-15 11:00:32,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,554 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:32,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-02-15 11:00:32,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-15 11:00:32,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:00:32,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-02-15 11:00:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:32,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:32,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:32,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-15 11:00:32,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:32,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:32,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:32,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:00:32,759 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-02-15 11:00:32,978 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-02-15 11:00:33,143 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-02-15 11:00:33,297 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-02-15 11:00:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:38,965 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-02-15 11:00:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:00:38,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:00:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:38,970 INFO L225 Difference]: With dead ends: 1903 [2019-02-15 11:00:38,971 INFO L226 Difference]: Without dead ends: 1896 [2019-02-15 11:00:38,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-15 11:00:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-02-15 11:00:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-02-15 11:00:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-02-15 11:00:44,756 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-02-15 11:00:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:44,756 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-02-15 11:00:44,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-02-15 11:00:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:00:44,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:44,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:00:44,759 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-02-15 11:00:44,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:44,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:44,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:44,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:44,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:44,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:44,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:44,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:44,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:44,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:44,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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:00:44,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:00:44,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:00:44,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:44,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:44,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:00:44,843 INFO L478 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 21 treesize of output 23 [2019-02-15 11:00:44,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:00:44,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:00:44,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:00:44,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:00:44,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,970 INFO L478 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 36 treesize of output 49 [2019-02-15 11:00:44,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,001 INFO L478 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 32 treesize of output 57 [2019-02-15 11:00:45,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:00:45,045 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:45,060 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:45,073 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:45,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:45,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:45,115 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:00:45,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:00:45,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:45,164 INFO L267 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-02-15 11:00:45,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:00:45,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,190 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:45,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:00:45,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:45,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:00:45,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 11:00:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:45,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:45,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:45,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:00:45,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:45,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:45,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:45,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:45,409 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-02-15 11:00:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:51,067 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-02-15 11:00:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:00:51,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:00:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:51,072 INFO L225 Difference]: With dead ends: 1884 [2019-02-15 11:00:51,072 INFO L226 Difference]: Without dead ends: 1877 [2019-02-15 11:00:51,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-02-15 11:00:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-02-15 11:00:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-02-15 11:00:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-02-15 11:00:56,953 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-02-15 11:00:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:56,954 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-02-15 11:00:56,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-02-15 11:00:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:00:56,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:56,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:00:56,957 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-02-15 11:00:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:56,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:56,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:57,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:57,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:57,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:00:57,059 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-15 11:00:57,060 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:57,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:57,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:57,062 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:57,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:57,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:57,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:57,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:57,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:57,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:57,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:00:57,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,104 INFO L478 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 36 treesize of output 49 [2019-02-15 11:00:57,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,142 INFO L478 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 32 treesize of output 57 [2019-02-15 11:00:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:00:57,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:00:57,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:00:57,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:00:57,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:00:57,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:00:57,271 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,494 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,593 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:57,627 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:00:57,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:00:57,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,678 INFO L267 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-02-15 11:00:57,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:00:57,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-15 11:00:57,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:57,797 INFO L267 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-02-15 11:00:57,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-15 11:00:57,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:57,829 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:57,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 11:00:57,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:57,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:00:57,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-15 11:00:57,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-02-15 11:00:57,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:58,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:00:58,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:58,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:00:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:00:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:58,022 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-02-15 11:01:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:07,051 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-02-15 11:01:07,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:01:07,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:01:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:07,058 INFO L225 Difference]: With dead ends: 2991 [2019-02-15 11:01:07,059 INFO L226 Difference]: Without dead ends: 2978 [2019-02-15 11:01:07,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:01:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-02-15 11:01:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-02-15 11:01:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-02-15 11:01:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-02-15 11:01:14,882 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-02-15 11:01:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:14,882 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-02-15 11:01:14,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:01:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-02-15 11:01:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:01:14,885 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:14,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:14,886 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:14,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-02-15 11:01:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:14,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:14,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:01:14,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:14,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:14,995 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:01:14,996 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-15 11:01:14,997 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:14,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:14,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:14,998 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:01:14,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:14,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:14,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:14,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:15,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:15,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:15,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:15,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:01:15,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:01:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:01:15,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:01:15,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:01:15,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:01:15,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:01:15,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:01:15,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:01:15,237 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,260 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,273 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,284 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,293 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,321 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-15 11:01:15,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:01:15,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,381 INFO L267 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-02-15 11:01:15,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:01:15,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:01:15,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,447 INFO L267 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-02-15 11:01:15,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:01:15,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,482 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:15,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 11:01:15,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,517 INFO L267 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-02-15 11:01:15,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 11:01:15,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,551 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 11:01:15,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,586 INFO L267 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-02-15 11:01:15,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-02-15 11:01:15,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,622 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:15,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:01:15,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:15,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-15 11:01:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:15,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:16,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:16,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 11:01:16,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:16,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:01:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:01:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:01:16,454 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-02-15 11:01:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:26,597 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-02-15 11:01:26,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:01:26,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-15 11:01:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:26,605 INFO L225 Difference]: With dead ends: 3181 [2019-02-15 11:01:26,605 INFO L226 Difference]: Without dead ends: 3179 [2019-02-15 11:01:26,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:01:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-02-15 11:01:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-02-15 11:01:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-15 11:01:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-02-15 11:01:34,243 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-02-15 11:01:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:34,243 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-02-15 11:01:34,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:01:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-02-15 11:01:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:01:34,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:34,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:34,247 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:34,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-02-15 11:01:34,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:34,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:34,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:34,396 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:01:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:01:34,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:01:34,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:01:34,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:01:34,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:01:34,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:01:34,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:01:34,419 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-02-15 11:01:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:41,399 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-02-15 11:01:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:01:41,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-15 11:01:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:41,405 INFO L225 Difference]: With dead ends: 2346 [2019-02-15 11:01:41,405 INFO L226 Difference]: Without dead ends: 2337 [2019-02-15 11:01:41,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:01:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-02-15 11:01:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-02-15 11:01:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-15 11:01:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-02-15 11:01:48,931 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-02-15 11:01:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:48,931 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-02-15 11:01:48,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:01:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-02-15 11:01:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:01:48,935 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:48,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:48,935 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:48,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-02-15 11:01:48,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:48,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:48,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:48,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:48,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:01:49,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:49,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:49,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:01:49,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:01:49,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:49,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:49,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:01:49,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:01:49,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:01:49,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:01:49,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:49,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:01:49,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:01:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:01:49,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:01:49,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:01:49,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:01:49,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:01:49,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:01:49,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:01:49,322 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,345 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,406 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-15 11:01:49,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:01:49,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,468 INFO L267 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-02-15 11:01:49,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:01:49,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:01:49,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,533 INFO L267 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-02-15 11:01:49,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:01:49,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,567 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:49,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:01:49,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,603 INFO L267 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-02-15 11:01:49,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-02-15 11:01:49,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,642 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:49,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:01:49,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,675 INFO L267 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-02-15 11:01:49,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 11:01:49,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,711 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:49,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:01:49,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:49,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-15 11:01:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:49,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:49,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:49,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 11:01:49,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:49,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:01:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:01:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:01:49,879 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-02-15 11:01:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:57,722 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-02-15 11:01:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:01:57,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-15 11:01:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:57,729 INFO L225 Difference]: With dead ends: 2345 [2019-02-15 11:01:57,729 INFO L226 Difference]: Without dead ends: 2338 [2019-02-15 11:01:57,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:01:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-02-15 11:01:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-02-15 11:01:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-02-15 11:01:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-02-15 11:01:59,855 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-02-15 11:01:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:59,855 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-02-15 11:01:59,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:01:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-02-15 11:01:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:01:59,856 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:59,856 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:59,856 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-02-15 11:01:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:59,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:01:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:59,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:01:59,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:59,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:59,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:01:59,903 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-15 11:01:59,903 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:59,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:59,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:59,906 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:01:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:59,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:59,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:59,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:59,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:59,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:59,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:01:59,931 INFO L478 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 21 treesize of output 23 [2019-02-15 11:01:59,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:59,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:01:59,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:59,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:59,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:59,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:01:59,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:01:59,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:59,971 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:59,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:59,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:02:00,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,031 INFO L478 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 22 treesize of output 38 [2019-02-15 11:02:00,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,172 INFO L303 Elim1Store]: Index analysis took 119 ms [2019-02-15 11:02:00,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:02:00,173 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,198 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:00,225 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 11:02:00,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:02:00,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-15 11:02:00,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,280 INFO L478 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 28 treesize of output 50 [2019-02-15 11:02:00,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-02-15 11:02:00,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-15 11:02:00,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,331 INFO L267 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-02-15 11:02:00,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-02-15 11:02:00,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:00,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-15 11:02:00,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:00,371 INFO L267 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-02-15 11:02:00,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-02-15 11:02:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:00,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:00,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:00,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:02:00,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:00,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:02:00,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:02:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:02:00,444 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-02-15 11:02:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:02,711 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-02-15 11:02:02,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:02:02,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:02:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:02,713 INFO L225 Difference]: With dead ends: 480 [2019-02-15 11:02:02,713 INFO L226 Difference]: Without dead ends: 477 [2019-02-15 11:02:02,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:02:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-15 11:02:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-02-15 11:02:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-15 11:02:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-02-15 11:02:03,599 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-02-15 11:02:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:03,599 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-02-15 11:02:03,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:02:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-02-15 11:02:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:03,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:03,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:03,600 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:03,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-02-15 11:02:03,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:03,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:03,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:02:03,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:03,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:03,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:02:03,657 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 11:02:03,658 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:03,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:03,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:03,659 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:02:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:03,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:03,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:03,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:03,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:03,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:03,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:03,740 INFO L478 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 21 treesize of output 23 [2019-02-15 11:02:03,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:03,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:03,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:02:03,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:02:03,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,850 INFO L478 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 36 treesize of output 49 [2019-02-15 11:02:03,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,884 INFO L478 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 32 treesize of output 57 [2019-02-15 11:02:03,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:03,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:02:03,928 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,942 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,955 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,970 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:03,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:03,996 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:02:04,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:02:04,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:04,046 INFO L267 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-02-15 11:02:04,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:02:04,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:02:04,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:04,088 INFO L267 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-02-15 11:02:04,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:02:04,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:04,115 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:04,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:02:04,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:04,138 INFO L267 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-02-15 11:02:04,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:02:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:04,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:04,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:04,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:02:04,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:04,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:02:04,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:02:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:02:04,200 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-02-15 11:02:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:05,996 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-02-15 11:02:05,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:02:05,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 11:02:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:05,997 INFO L225 Difference]: With dead ends: 250 [2019-02-15 11:02:05,997 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 11:02:05,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:02:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 11:02:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-02-15 11:02:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-15 11:02:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-02-15 11:02:07,499 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-02-15 11:02:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:07,499 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-02-15 11:02:07,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:02:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-02-15 11:02:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:07,500 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:07,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:07,500 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-02-15 11:02:07,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:07,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:07,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:07,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:07,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:02:07,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:07,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:07,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:02:07,592 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-15 11:02:07,593 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:07,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:07,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:07,595 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:02:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:07,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:07,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:07,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:07,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:07,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:07,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:07,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:07,614 INFO L478 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 21 treesize of output 23 [2019-02-15 11:02:07,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:07,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:07,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:02:07,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:02:07,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,746 INFO L478 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 22 treesize of output 38 [2019-02-15 11:02:07,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:02:07,774 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,782 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:07,809 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 11:02:07,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:02:07,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-15 11:02:07,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,865 INFO L478 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 28 treesize of output 50 [2019-02-15 11:02:07,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,879 INFO L267 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-02-15 11:02:07,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-15 11:02:07,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,901 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:07,902 INFO L478 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 28 treesize of output 56 [2019-02-15 11:02:07,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,917 INFO L267 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-02-15 11:02:07,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-15 11:02:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:07,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:07,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:07,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:02:07,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:07,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:02:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:02:07,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:02:07,979 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-02-15 11:02:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:11,078 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-02-15 11:02:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:02:11,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 11:02:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:11,080 INFO L225 Difference]: With dead ends: 372 [2019-02-15 11:02:11,080 INFO L226 Difference]: Without dead ends: 362 [2019-02-15 11:02:11,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:02:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-15 11:02:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-02-15 11:02:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-15 11:02:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-02-15 11:02:13,351 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-02-15 11:02:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:13,351 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-02-15 11:02:13,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:02:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-02-15 11:02:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:13,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:13,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:13,353 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-02-15 11:02:13,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:13,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:13,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:13,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:13,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:13,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:13,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:02:13,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:02:13,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:13,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:13,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:02:13,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:02:13,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:02:13,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:02:13,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:13,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:13,435 INFO L478 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 21 treesize of output 23 [2019-02-15 11:02:13,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:13,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:13,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:02:13,456 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:02:13,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,546 INFO L478 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 36 treesize of output 49 [2019-02-15 11:02:13,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,580 INFO L478 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 32 treesize of output 57 [2019-02-15 11:02:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:02:13,623 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,637 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,651 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,666 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:13,692 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:02:13,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:02:13,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,741 INFO L267 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-02-15 11:02:13,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:02:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,767 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:13,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:02:13,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:02:13,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:02:13,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 11:02:13,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:13,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:02:13,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:13,923 INFO L267 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-02-15 11:02:13,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-15 11:02:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:13,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:14,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:14,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:02:14,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:14,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:02:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:02:14,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:02:14,008 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-02-15 11:02:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:16,810 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-02-15 11:02:16,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:02:16,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 11:02:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:16,812 INFO L225 Difference]: With dead ends: 332 [2019-02-15 11:02:16,812 INFO L226 Difference]: Without dead ends: 325 [2019-02-15 11:02:16,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:02:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-15 11:02:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-02-15 11:02:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-15 11:02:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-02-15 11:02:19,136 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-02-15 11:02:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:19,137 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-02-15 11:02:19,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:02:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-02-15 11:02:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:19,137 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:19,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:19,138 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:19,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-02-15 11:02:19,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:19,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:19,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:02:19,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:19,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:02:19,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:19,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:19,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:02:19,277 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-15 11:02:19,278 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:19,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:19,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:19,280 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:02:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:19,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:19,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:19,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:19,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:19,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:19,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:19,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:02:19,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,322 INFO L478 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 36 treesize of output 49 [2019-02-15 11:02:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,355 INFO L478 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 32 treesize of output 57 [2019-02-15 11:02:19,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:02:19,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:19,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:02:19,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:19,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:19,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:02:19,473 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,493 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,514 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:19,549 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:02:19,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:02:19,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,612 INFO L267 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-02-15 11:02:19,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:02:19,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,638 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:19,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:02:19,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,659 INFO L267 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-02-15 11:02:19,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:02:19,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:19,684 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:19,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:02:19,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:19,705 INFO L267 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-02-15 11:02:19,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:02:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:19,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:19,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:19,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:02:19,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:19,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:02:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:02:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:02:19,791 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-02-15 11:02:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:22,366 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-02-15 11:02:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:02:22,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 11:02:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:22,367 INFO L225 Difference]: With dead ends: 294 [2019-02-15 11:02:22,368 INFO L226 Difference]: Without dead ends: 287 [2019-02-15 11:02:22,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:02:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-15 11:02:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-02-15 11:02:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-15 11:02:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-02-15 11:02:24,701 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-02-15 11:02:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:24,701 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-02-15 11:02:24,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:02:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-02-15 11:02:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:24,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:24,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:24,702 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-02-15 11:02:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:24,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:24,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:02:24,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:24,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:24,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:02:24,823 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-15 11:02:24,823 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:24,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:24,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:24,828 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:02:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:24,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:24,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:24,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:24,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:24,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:24,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:24,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:24,848 INFO L478 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 21 treesize of output 23 [2019-02-15 11:02:24,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:24,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:24,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:02:24,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:24,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:24,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:24,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:24,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:24,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:02:24,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,963 INFO L478 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 36 treesize of output 49 [2019-02-15 11:02:24,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:24,997 INFO L478 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 32 treesize of output 57 [2019-02-15 11:02:25,446 WARN L181 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-02-15 11:02:25,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:02:25,456 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:25,470 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:25,483 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:25,498 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:25,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:25,525 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:02:25,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:02:25,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:25,581 INFO L267 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-02-15 11:02:25,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:02:25,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:02:25,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:02:25,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:02:25,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-02-15 11:02:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,792 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:25,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-02-15 11:02:25,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:25,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:25,850 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:25,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:02:25,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:25,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:02:25,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-02-15 11:02:25,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-02-15 11:02:25,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:26,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:26,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:02:26,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:26,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:02:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:02:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:02:26,051 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-02-15 11:02:26,455 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-02-15 11:02:26,691 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-02-15 11:02:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:29,680 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-02-15 11:02:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:02:29,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:02:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:29,682 INFO L225 Difference]: With dead ends: 364 [2019-02-15 11:02:29,683 INFO L226 Difference]: Without dead ends: 357 [2019-02-15 11:02:29,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:02:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-02-15 11:02:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-02-15 11:02:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-15 11:02:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-02-15 11:02:32,188 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-02-15 11:02:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:32,188 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-02-15 11:02:32,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:02:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-02-15 11:02:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:32,189 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:32,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:32,189 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-02-15 11:02:32,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:32,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:32,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:32,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:32,356 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-02-15 11:02:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:02:32,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:32,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:32,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:02:32,388 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-15 11:02:32,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:32,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:32,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:32,391 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:02:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:32,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:32,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:32,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:32,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:32,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:32,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:32,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:32,413 INFO L478 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 21 treesize of output 23 [2019-02-15 11:02:32,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:32,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:32,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:02:32,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,461 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:02:32,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,526 INFO L478 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 36 treesize of output 49 [2019-02-15 11:02:32,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,560 INFO L478 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 32 treesize of output 57 [2019-02-15 11:02:32,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:02:32,602 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,616 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,645 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:32,671 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:02:32,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:02:32,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,731 INFO L267 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-02-15 11:02:32,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:02:32,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 11:02:32,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,778 INFO L267 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-02-15 11:02:32,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:02:32,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:32,803 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:32,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:02:32,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:32,825 INFO L267 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-02-15 11:02:32,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:02:32,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-02-15 11:02:32,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:32,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:32,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:02:32,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:32,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:02:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:02:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:02:32,892 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-02-15 11:02:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:35,864 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-02-15 11:02:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:02:35,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 11:02:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:35,865 INFO L225 Difference]: With dead ends: 319 [2019-02-15 11:02:35,866 INFO L226 Difference]: Without dead ends: 312 [2019-02-15 11:02:35,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:02:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-02-15 11:02:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-02-15 11:02:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-15 11:02:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-02-15 11:02:38,684 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-02-15 11:02:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:38,684 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-02-15 11:02:38,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:02:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-02-15 11:02:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:38,685 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:38,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:38,685 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:38,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-02-15 11:02:38,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:38,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:38,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:02:38,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:38,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:38,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:02:38,797 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-15 11:02:38,797 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:38,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:38,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:38,799 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:02:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:38,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:38,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:38,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:38,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:38,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:38,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:38,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:02:38,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,867 INFO L478 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 36 treesize of output 49 [2019-02-15 11:02:38,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,903 INFO L478 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 32 treesize of output 57 [2019-02-15 11:02:38,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:38,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:02:38,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:38,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:38,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:39,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:02:39,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:39,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:39,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:02:39,036 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,058 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,070 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,079 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,088 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:39,115 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:02:39,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:02:39,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:02:39,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:02:39,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-15 11:02:39,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-02-15 11:02:39,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-15 11:02:39,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:02:39,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-02-15 11:02:39,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,501 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:39,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:02:39,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,561 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:39,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:39,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-15 11:02:39,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:39,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:02:39,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-15 11:02:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:39,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:39,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:39,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:02:39,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:39,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:02:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:02:39,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:02:39,707 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-02-15 11:02:39,939 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-02-15 11:02:41,061 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-02-15 11:02:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:43,948 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-02-15 11:02:43,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:02:43,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:02:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:43,950 INFO L225 Difference]: With dead ends: 392 [2019-02-15 11:02:43,950 INFO L226 Difference]: Without dead ends: 386 [2019-02-15 11:02:43,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:02:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-15 11:02:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-02-15 11:02:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-02-15 11:02:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-02-15 11:02:46,984 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-02-15 11:02:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:46,984 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-02-15 11:02:46,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:02:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-02-15 11:02:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:02:46,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:46,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:46,985 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-15 11:02:46,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:46,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:46,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:46,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:46,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:02:47,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:02:47,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:02:47,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:02:47,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:02:47,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:02:47,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:02:47,051 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-02-15 11:02:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:49,944 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-02-15 11:02:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:02:49,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-15 11:02:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:49,946 INFO L225 Difference]: With dead ends: 320 [2019-02-15 11:02:49,946 INFO L226 Difference]: Without dead ends: 315 [2019-02-15 11:02:49,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:02:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-15 11:02:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-02-15 11:02:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-02-15 11:02:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-02-15 11:02:52,943 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-02-15 11:02:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:52,943 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-02-15 11:02:52,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:02:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-02-15 11:02:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:02:52,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:52,944 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:52,944 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-02-15 11:02:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:52,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:52,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:52,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:52,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:02:53,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:53,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:53,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:02:53,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:02:53,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:53,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:02:53,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:02:53,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:02:53,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:02:53,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:02:53,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:53,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:02:53,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,041 INFO L478 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 36 treesize of output 49 [2019-02-15 11:02:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,073 INFO L478 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 32 treesize of output 57 [2019-02-15 11:02:53,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:02:53,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:02:53,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:02:53,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:02:53,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:02:53,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:02:53,191 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,212 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,233 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,242 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:02:53,268 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:02:53,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:02:53,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,319 INFO L267 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-02-15 11:02:53,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:02:53,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-02-15 11:02:53,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,379 INFO L267 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-02-15 11:02:53,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-02-15 11:02:53,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:02:53,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:02:53,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:02:53,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-15 11:02:53,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:53,563 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:53,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:02:53,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:53,584 INFO L267 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-02-15 11:02:53,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:02:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:53,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:53,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:53,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:02:53,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:53,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:02:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:02:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:02:53,693 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-02-15 11:02:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:59,749 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-02-15 11:02:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:02:59,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:02:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:59,751 INFO L225 Difference]: With dead ends: 601 [2019-02-15 11:02:59,751 INFO L226 Difference]: Without dead ends: 591 [2019-02-15 11:02:59,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:02:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-02-15 11:03:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-02-15 11:03:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-02-15 11:03:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-02-15 11:03:04,823 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-02-15 11:03:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:04,823 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-02-15 11:03:04,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:03:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-02-15 11:03:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:03:04,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:04,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:03:04,824 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-02-15 11:03:04,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:04,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:04,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:03:04,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:04,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:03:04,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:04,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:04,973 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:03:04,973 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 11:03:04,974 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:03:04,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:03:04,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:03:04,976 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:03:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:04,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:03:04,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:04,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:03:04,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:04,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:03:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:04,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:04,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:03:05,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,013 INFO L478 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 36 treesize of output 49 [2019-02-15 11:03:05,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,050 INFO L478 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 32 treesize of output 57 [2019-02-15 11:03:05,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:03:05,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:03:05,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:03:05,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:03:05,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:03:05,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:03:05,183 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,204 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,216 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,225 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:03:05,260 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:03:05,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:03:05,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,309 INFO L267 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-02-15 11:03:05,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:03:05,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-15 11:03:05,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,367 INFO L267 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-02-15 11:03:05,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-15 11:03:05,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,398 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:05,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 11:03:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:03:05,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:03:05,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-15 11:03:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:05,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:03:05,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:05,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:03:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:03:05,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:03:05,586 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-02-15 11:03:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:03:15,041 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-02-15 11:03:15,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:03:15,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:03:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:03:15,043 INFO L225 Difference]: With dead ends: 731 [2019-02-15 11:03:15,043 INFO L226 Difference]: Without dead ends: 718 [2019-02-15 11:03:15,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:03:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-02-15 11:03:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-02-15 11:03:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-02-15 11:03:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-02-15 11:03:23,297 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-02-15 11:03:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:23,298 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-02-15 11:03:23,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:03:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-02-15 11:03:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:03:23,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:23,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:03:23,299 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-02-15 11:03:23,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:23,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:23,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:23,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:23,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:03:23,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:23,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:23,425 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:03:23,425 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 11:03:23,426 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:03:23,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:03:23,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:03:23,428 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:03:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:23,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:03:23,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:23,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:03:23,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:23,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:03:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:23,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:23,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:03:23,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,503 INFO L478 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 36 treesize of output 49 [2019-02-15 11:03:23,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,542 INFO L478 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 32 treesize of output 57 [2019-02-15 11:03:23,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:03:23,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:03:23,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:03:23,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:03:23,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:03:23,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:03:23,673 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,707 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,719 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,728 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:03:23,763 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:03:23,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:03:23,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-02-15 11:03:23,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:03:23,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,873 INFO L267 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-02-15 11:03:23,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-15 11:03:23,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,902 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:23,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:03:23,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,926 INFO L267 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-02-15 11:03:23,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 11:03:23,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:23,956 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:23,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:03:23,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:23,978 INFO L267 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-02-15 11:03:23,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-02-15 11:03:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:24,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:24,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:24,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:03:24,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:24,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:03:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:03:24,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:03:24,086 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-02-15 11:03:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:03:33,937 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-02-15 11:03:33,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:03:33,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:03:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:03:33,939 INFO L225 Difference]: With dead ends: 480 [2019-02-15 11:03:33,939 INFO L226 Difference]: Without dead ends: 473 [2019-02-15 11:03:33,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:03:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-02-15 11:03:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-02-15 11:03:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-15 11:03:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-02-15 11:03:37,161 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-02-15 11:03:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:37,161 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-02-15 11:03:37,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:03:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-02-15 11:03:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:03:37,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:37,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:03:37,162 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-15 11:03:37,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:37,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:37,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:37,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:37,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:03:37,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:37,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:37,266 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:03:37,266 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-15 11:03:37,267 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:03:37,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:03:37,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:03:37,269 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:03:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:37,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:03:37,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:37,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:03:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:37,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:03:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:37,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:37,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:03:37,302 INFO L478 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 21 treesize of output 23 [2019-02-15 11:03:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:03:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:03:37,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:03:37,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:03:37,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,437 INFO L478 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 36 treesize of output 49 [2019-02-15 11:03:37,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,472 INFO L478 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 32 treesize of output 57 [2019-02-15 11:03:37,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:03:37,516 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,530 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,544 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,559 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:03:37,585 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:03:37,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:03:37,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,643 INFO L267 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-02-15 11:03:37,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:03:37,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:03:37,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,690 INFO L267 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-02-15 11:03:37,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:03:37,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,715 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:37,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:37,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 11:03:37,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:37,740 INFO L267 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-02-15 11:03:37,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:03:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:37,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:37,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:37,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:03:37,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:37,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:03:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:03:37,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:03:37,810 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-02-15 11:03:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:03:42,953 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-02-15 11:03:42,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:03:42,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:03:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:03:42,955 INFO L225 Difference]: With dead ends: 258 [2019-02-15 11:03:42,955 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 11:03:42,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:03:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 11:03:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-02-15 11:03:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-02-15 11:03:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-02-15 11:03:47,324 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-02-15 11:03:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:47,325 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-02-15 11:03:47,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:03:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-02-15 11:03:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:03:47,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:47,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:03:47,326 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-02-15 11:03:47,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:47,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:47,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:03:47,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:47,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:47,493 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:03:47,493 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-15 11:03:47,494 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:03:47,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:03:47,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:03:47,495 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:03:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:47,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:03:47,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:47,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:03:47,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:47,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:03:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:47,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:47,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:03:47,517 INFO L478 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 21 treesize of output 23 [2019-02-15 11:03:47,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:03:47,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:03:47,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:03:47,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,583 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:03:47,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,629 INFO L478 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 36 treesize of output 49 [2019-02-15 11:03:47,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,662 INFO L478 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 32 treesize of output 57 [2019-02-15 11:03:47,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:03:47,707 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,721 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,734 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,749 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,775 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-15 11:03:47,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:03:47,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:47,837 INFO L267 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-02-15 11:03:47,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-15 11:03:47,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:47,875 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:47,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:03:47,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:03:47,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:03:47,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-15 11:03:48,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,018 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:48,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-15 11:03:48,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:48,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-02-15 11:03:48,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:48,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:03:48,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-02-15 11:03:48,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,190 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:48,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-02-15 11:03:48,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:48,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:48,254 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:48,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-15 11:03:48,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:48,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:03:48,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-02-15 11:03:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:48,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:03:48,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:48,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:03:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:03:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:03:48,518 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-02-15 11:03:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:03:54,520 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-02-15 11:03:54,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:03:54,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:03:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:03:54,521 INFO L225 Difference]: With dead ends: 295 [2019-02-15 11:03:54,521 INFO L226 Difference]: Without dead ends: 284 [2019-02-15 11:03:54,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:03:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-15 11:03:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-02-15 11:03:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 11:03:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-02-15 11:03:59,137 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-02-15 11:03:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:59,137 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-02-15 11:03:59,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:03:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-02-15 11:03:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:03:59,138 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:59,138 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:03:59,138 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-15 11:03:59,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:59,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:59,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:59,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:59,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:03:59,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:59,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:59,247 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:03:59,247 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-15 11:03:59,251 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:03:59,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:03:59,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:03:59,252 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:03:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:59,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:03:59,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:59,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:03:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:59,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:03:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:59,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:59,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:03:59,274 INFO L478 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 21 treesize of output 23 [2019-02-15 11:03:59,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:03:59,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:03:59,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:03:59,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:03:59,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,388 INFO L478 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 36 treesize of output 49 [2019-02-15 11:03:59,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,422 INFO L478 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 32 treesize of output 57 [2019-02-15 11:03:59,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:03:59,465 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,479 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,493 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,508 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:03:59,534 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 11:03:59,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:03:59,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,578 INFO L267 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-02-15 11:03:59,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:03:59,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:03:59,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:03:59,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:03:59,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-15 11:03:59,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:59,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:03:59,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:59,777 INFO L267 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-02-15 11:03:59,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-02-15 11:03:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:59,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:03:59,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:59,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:03:59,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:59,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:03:59,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:03:59,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:03:59,849 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-02-15 11:04:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:04:06,602 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-02-15 11:04:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:04:06,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:04:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:04:06,603 INFO L225 Difference]: With dead ends: 328 [2019-02-15 11:04:06,604 INFO L226 Difference]: Without dead ends: 315 [2019-02-15 11:04:06,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:04:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-15 11:04:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-02-15 11:04:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-02-15 11:04:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-02-15 11:04:13,102 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-02-15 11:04:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:04:13,103 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-02-15 11:04:13,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:04:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-02-15 11:04:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:04:13,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:04:13,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:04:13,103 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:04:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-15 11:04:13,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:04:13,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:13,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:13,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:13,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:04:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:04:13,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:13,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:04:13,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:04:13,198 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-15 11:04:13,198 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:04:13,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:04:13,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:04:13,200 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:04:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:13,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:04:13,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:13,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:04:13,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:13,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:04:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:13,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:04:13,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:04:13,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:04:13,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:04:13,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:04:13,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:04:13,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:04:13,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:04:13,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:04:13,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:04:13,445 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,466 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,491 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,500 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:04:13,529 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:04:13,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:04:13,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,597 INFO L267 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-02-15 11:04:13,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:04:13,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 11:04:13,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,660 INFO L267 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-02-15 11:04:13,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 11:04:13,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,692 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:04:13,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:13,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:04:13,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:13,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:04:13,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 11:04:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:04:13,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:04:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:04:13,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:04:13,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:04:13,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:04:13,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:04:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:04:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:04:13,809 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-02-15 11:04:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:04:22,874 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-02-15 11:04:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:04:22,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:04:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:04:22,875 INFO L225 Difference]: With dead ends: 326 [2019-02-15 11:04:22,875 INFO L226 Difference]: Without dead ends: 313 [2019-02-15 11:04:22,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:04:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-02-15 11:04:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-02-15 11:04:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-15 11:04:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-02-15 11:04:30,843 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-02-15 11:04:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:04:30,844 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-02-15 11:04:30,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:04:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-02-15 11:04:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:04:30,844 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:04:30,844 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:04:30,845 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:04:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-02-15 11:04:30,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:04:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:30,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:30,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:04:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 11:04:30,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:30,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:04:30,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:04:30,911 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-15 11:04:30,912 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:04:30,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:04:30,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:04:30,914 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:04:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:30,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:04:30,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:30,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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:04:30,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:30,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:04:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:30,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:04:30,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:04:31,016 INFO L478 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 21 treesize of output 23 [2019-02-15 11:04:31,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:04:31,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:04:31,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:04:31,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,188 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:04:31,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,256 INFO L478 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 36 treesize of output 49 [2019-02-15 11:04:31,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,289 INFO L478 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 32 treesize of output 57 [2019-02-15 11:04:31,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:04:31,336 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,350 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,363 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,378 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:04:31,404 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:04:31,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:04:31,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:04:31,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:04:31,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-15 11:04:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,572 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:04:31,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-15 11:04:31,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,591 INFO L267 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-02-15 11:04:31,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-02-15 11:04:31,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 11:04:31,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,636 INFO L267 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-02-15 11:04:31,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:04:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:31,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-15 11:04:31,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:31,690 INFO L267 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-02-15 11:04:31,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-02-15 11:04:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:04:31,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:04:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:04:31,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:04:31,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:04:31,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:04:31,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:04:31,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:04:31,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:04:31,770 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-02-15 11:04:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:04:42,638 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-02-15 11:04:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:04:42,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 11:04:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:04:42,640 INFO L225 Difference]: With dead ends: 400 [2019-02-15 11:04:42,640 INFO L226 Difference]: Without dead ends: 393 [2019-02-15 11:04:42,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:04:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-15 11:04:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-02-15 11:04:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-15 11:04:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-02-15 11:04:52,707 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-02-15 11:04:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:04:52,707 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-02-15 11:04:52,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:04:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-02-15 11:04:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:04:52,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:04:52,708 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:04:52,708 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:04:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:52,709 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-02-15 11:04:52,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:04:52,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:52,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:52,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:52,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:04:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:52,852 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-02-15 11:04:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 11:04:52,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:52,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:04:52,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:04:52,908 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-02-15 11:04:52,909 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:04:52,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:04:52,911 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:04:52,911 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:04:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:52,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:04:52,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:52,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:04:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:52,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:04:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:52,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:04:52,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:04:52,933 INFO L478 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 21 treesize of output 23 [2019-02-15 11:04:52,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:04:52,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:04:52,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:04:52,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:04:53,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,069 INFO L478 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 36 treesize of output 49 [2019-02-15 11:04:53,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,103 INFO L478 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 32 treesize of output 57 [2019-02-15 11:04:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:04:53,147 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,161 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,174 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,189 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:04:53,215 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:04:53,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:04:53,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:04:53,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:04:53,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-15 11:04:53,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,404 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:04:53,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-02-15 11:04:53,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,464 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:04:53,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-02-15 11:04:53,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:04:53,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-02-15 11:04:53,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-02-15 11:04:53,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,617 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:04:53,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 11:04:53,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:04:53,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-02-15 11:04:53,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-02-15 11:04:53,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:53,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-02-15 11:04:53,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:53,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:04:53,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-15 11:04:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:04:53,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:04:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:04:53,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:04:53,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:04:53,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:04:53,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:04:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:04:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:04:53,926 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-02-15 11:05:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:05:05,937 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-02-15 11:05:05,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:05:05,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 11:05:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:05:05,939 INFO L225 Difference]: With dead ends: 441 [2019-02-15 11:05:05,940 INFO L226 Difference]: Without dead ends: 428 [2019-02-15 11:05:05,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:05:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-02-15 11:05:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-02-15 11:05:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-15 11:05:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-02-15 11:05:16,011 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-02-15 11:05:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:05:16,011 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-02-15 11:05:16,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:05:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-02-15 11:05:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:05:16,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:05:16,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:05:16,012 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:05:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:05:16,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-02-15 11:05:16,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:05:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:05:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:16,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:05:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:05:16,286 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-02-15 11:05:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 11:05:16,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:16,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:05:16,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:05:16,370 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-15 11:05:16,371 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:05:16,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:05:16,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:05:16,373 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:05:16,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:05:16,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:05:16,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:16,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:05:16,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:05:16,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:05:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:05:16,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:05:16,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:05:16,395 INFO L478 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 21 treesize of output 23 [2019-02-15 11:05:16,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:05:16,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:05:16,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:05:16,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,442 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:05:16,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,514 INFO L478 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 36 treesize of output 49 [2019-02-15 11:05:16,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,547 INFO L478 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 32 treesize of output 57 [2019-02-15 11:05:16,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:05:16,591 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,605 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,633 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:05:16,659 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:05:16,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:05:16,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:05:16,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:16,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-15 11:05:16,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-02-15 11:05:16,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:16,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-02-15 11:05:16,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:16,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:16,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-02-15 11:05:17,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,029 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:17,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-15 11:05:17,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:17,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,092 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:17,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-15 11:05:17,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:17,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:17,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-15 11:05:17,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,187 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:17,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-02-15 11:05:17,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:17,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:17,247 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:17,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-02-15 11:05:17,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:17,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:17,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-02-15 11:05:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:05:17,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:05:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:05:17,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:05:17,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:05:17,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:05:17,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:05:17,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:05:17,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:05:17,422 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-02-15 11:05:24,755 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-02-15 11:05:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:05:36,867 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-02-15 11:05:36,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:05:36,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:05:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:05:36,869 INFO L225 Difference]: With dead ends: 685 [2019-02-15 11:05:36,869 INFO L226 Difference]: Without dead ends: 677 [2019-02-15 11:05:36,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:05:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-02-15 11:05:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-02-15 11:05:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-02-15 11:05:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-02-15 11:05:51,967 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-02-15 11:05:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:05:51,968 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-02-15 11:05:51,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:05:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-02-15 11:05:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:05:51,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:05:51,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:05:51,969 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:05:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:05:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-02-15 11:05:51,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:05:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:05:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:51,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:05:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:05:52,157 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-02-15 11:05:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:05:52,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:52,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:05:52,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:05:52,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:05:52,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:52,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:05:52,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:05:52,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:05:52,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:05:52,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:05:52,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:05:52,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:05:52,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,289 INFO L478 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 36 treesize of output 49 [2019-02-15 11:05:52,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,325 INFO L478 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 32 treesize of output 57 [2019-02-15 11:05:52,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:05:52,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:05:52,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:05:52,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:05:52,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:05:52,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:05:52,445 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,466 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,477 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,486 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,496 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:52,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:05:52,522 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:05:52,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:05:52,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:05:52,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:52,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-15 11:05:52,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:52,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-15 11:05:52,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:53,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,206 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:53,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-15 11:05:53,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:53,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:53,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-02-15 11:05:53,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,363 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:53,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-15 11:05:53,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:53,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-15 11:05:53,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:53,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:53,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-02-15 11:05:53,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-15 11:05:53,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:53,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:53,579 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:53,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-02-15 11:05:53,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:53,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:05:53,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-15 11:05:53,830 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-02-15 11:05:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:05:53,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:05:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:05:53,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:05:53,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:05:53,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:05:53,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:05:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:05:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:05:53,909 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-02-15 11:05:56,822 WARN L181 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-02-15 11:05:57,299 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-02-15 11:06:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:11,192 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-02-15 11:06:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:06:11,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 11:06:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:11,194 INFO L225 Difference]: With dead ends: 550 [2019-02-15 11:06:11,194 INFO L226 Difference]: Without dead ends: 543 [2019-02-15 11:06:11,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:06:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-02-15 11:06:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-02-15 11:06:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:06:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-15 11:06:14,118 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-02-15 11:06:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:06:14,118 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-15 11:06:14,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:06:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-15 11:06:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:06:14,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:06:14,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:06:14,119 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:06:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-02-15 11:06:14,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:06:14,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:14,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:06:14,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:14,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:06:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:06:14,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:14,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:06:14,191 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 11:06:14,191 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 11:06:14,191 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:06:14,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:06:14,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:06:14,194 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:06:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:14,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:06:14,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:14,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:06:14,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:14,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:06:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:14,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:06:14,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:06:14,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:06:14,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:06:14,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:14,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:06:14,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:14,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:14,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:14,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:14,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:06:14,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:06:14,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:06:14,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:06:14,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:06:14,452 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:14,845 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,058 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,228 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,380 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:06:15,622 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:06:15,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:06:15,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,689 INFO L267 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-02-15 11:06:15,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:06:15,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:06:15,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,755 INFO L267 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-02-15 11:06:15,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:06:15,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,789 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:15,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:06:15,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,823 INFO L267 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-02-15 11:06:15,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-15 11:06:15,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:15,859 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:15,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:06:15,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:15,893 INFO L267 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-02-15 11:06:15,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 11:06:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:16,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:06:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:16,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:06:16,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 11:06:16,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:06:16,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:06:16,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:06:16,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:06:16,451 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-15 11:06:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:22,260 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-02-15 11:06:22,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:06:22,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-15 11:06:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:22,261 INFO L225 Difference]: With dead ends: 67 [2019-02-15 11:06:22,261 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 11:06:22,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:06:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 11:06:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-02-15 11:06:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 11:06:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-02-15 11:06:25,415 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-02-15 11:06:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:06:25,415 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-02-15 11:06:25,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:06:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-02-15 11:06:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:06:25,415 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:06:25,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:06:25,416 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:06:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-02-15 11:06:25,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:06:25,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:25,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:25,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:25,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:06:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 11:06:25,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:25,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:06:25,539 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 11:06:25,539 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-15 11:06:25,540 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:06:25,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:06:25,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:06:25,542 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:06:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:25,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:06:25,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:25,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:06:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:25,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:06:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:25,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:06:25,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:06:25,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,578 INFO L478 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 36 treesize of output 49 [2019-02-15 11:06:25,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,613 INFO L478 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 32 treesize of output 57 [2019-02-15 11:06:25,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:06:25,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:06:25,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:06:25,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:06:25,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:06:25,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:06:25,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,755 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,767 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,776 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,791 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,817 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-15 11:06:25,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:06:25,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:25,877 INFO L267 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-02-15 11:06:25,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-15 11:06:25,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:25,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:06:25,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:06:26,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:06:26,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-02-15 11:06:26,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,069 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:26,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:06:26,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:26,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,130 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:26,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-02-15 11:06:26,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:26,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:06:26,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-15 11:06:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,238 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:26,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-02-15 11:06:26,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:26,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:26,305 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:26,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-15 11:06:26,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:26,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:06:26,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-02-15 11:06:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:26,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:06:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:26,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:06:26,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:06:26,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:06:26,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:06:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:06:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:06:26,489 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-02-15 11:06:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:32,562 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-02-15 11:06:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:06:32,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-15 11:06:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:32,563 INFO L225 Difference]: With dead ends: 74 [2019-02-15 11:06:32,563 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 11:06:32,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:06:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 11:06:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-02-15 11:06:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:06:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-15 11:06:36,042 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-02-15 11:06:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:06:36,042 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-15 11:06:36,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:06:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-15 11:06:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:06:36,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:06:36,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:06:36,043 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:06:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-02-15 11:06:36,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:06:36,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:36,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:36,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:36,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:06:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:06:36,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:36,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:06:36,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 11:06:36,175 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 11:06:36,176 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:06:36,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:06:36,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:06:36,177 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:06:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:36,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:06:36,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:36,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:06:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:36,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:06:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:36,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:06:36,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:06:36,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,216 INFO L478 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 36 treesize of output 49 [2019-02-15 11:06:36,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,249 INFO L478 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 32 treesize of output 57 [2019-02-15 11:06:36,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:06:36,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:06:36,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:06:36,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:06:36,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:06:36,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:06:36,372 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,392 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,404 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,413 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,423 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:06:36,449 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:06:36,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:06:36,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,514 INFO L267 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-02-15 11:06:36,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:06:36,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:06:36,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,567 INFO L267 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-02-15 11:06:36,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:06:36,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,593 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:36,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 11:06:36,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,615 INFO L267 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-02-15 11:06:36,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:06:36,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:36,643 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:36,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 11:06:36,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:36,664 INFO L267 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-02-15 11:06:36,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:06:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:36,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:06:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:36,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:06:36,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:06:36,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:06:36,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:06:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:06:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:06:36,744 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-15 11:06:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:43,824 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-02-15 11:06:43,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:06:43,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-15 11:06:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:43,825 INFO L225 Difference]: With dead ends: 80 [2019-02-15 11:06:43,825 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:06:43,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:06:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:06:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-02-15 11:06:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 11:06:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-02-15 11:06:50,116 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-02-15 11:06:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:06:50,116 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-02-15 11:06:50,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:06:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-02-15 11:06:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-15 11:06:50,117 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:06:50,117 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:06:50,117 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:06:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:50,117 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-02-15 11:06:50,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:06:50,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:50,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:50,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:50,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:06:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-15 11:06:50,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:50,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:06:50,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:06:50,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:06:50,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:50,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:06:50,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:06:50,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:06:50,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:06:50,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:06:50,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:06:50,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:06:50,241 INFO L478 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 21 treesize of output 23 [2019-02-15 11:06:50,248 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-15 11:06:50,256 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 11:06:50,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:06:50,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,285 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-15 11:06:50,331 INFO L478 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 20 treesize of output 22 [2019-02-15 11:06:50,335 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-02-15 11:06:50,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-15 11:06:50,356 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,363 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,370 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:06:50,393 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-02-15 11:06:50,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,427 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:06:50,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:06:50,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 11:06:50,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-15 11:06:50,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-02-15 11:06:50,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,509 INFO L478 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 32 treesize of output 42 [2019-02-15 11:06:50,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 11:06:50,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-02-15 11:06:50,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-15 11:06:50,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-15 11:06:50,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:06:50,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-02-15 11:06:50,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-15 11:06:50,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-15 11:06:50,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:06:50,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-02-15 11:06:50,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,741 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:50,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,743 INFO L478 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 30 treesize of output 55 [2019-02-15 11:06:50,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:50,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-15 11:06:50,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:50,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:06:50,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-02-15 11:06:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:50,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:06:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:50,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:06:50,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 11:06:50,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:06:50,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:06:50,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:06:50,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:06:50,910 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-02-15 11:06:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:57,773 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-02-15 11:06:57,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:06:57,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-02-15 11:06:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:57,774 INFO L225 Difference]: With dead ends: 71 [2019-02-15 11:06:57,774 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 11:06:57,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:06:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 11:06:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 11:06:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 11:06:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 11:06:57,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-02-15 11:06:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:06:57,776 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 11:06:57,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:06:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 11:06:57,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 11:06:57,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 11:06:57,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:06:58,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:06:58,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:01,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:10,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:10,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:10,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:10,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:10,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:10,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:31,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:31,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:07:54,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:05,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:06,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:08,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:08,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:14,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:19,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:23,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:38,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:08:38,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent.