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-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:33:48,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:33:48,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:33:48,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:33:48,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:33:48,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:33:48,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:33:48,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:33:48,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:33:48,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:33:48,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:33:48,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:33:48,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:33:48,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:33:48,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:33:48,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:33:48,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:33:48,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:33:48,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:33:48,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:33:48,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:33:48,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:33:48,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:33:48,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:33:48,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:33:48,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:33:48,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:33:48,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:33:48,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:33:48,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:33:48,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:33:48,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:33:48,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:33:48,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:33:48,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:33:48,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:33:48,487 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-01-07 21:33:48,504 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:33:48,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:33:48,506 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:33:48,508 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:33:48,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:33:48,508 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:33:48,508 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:33:48,509 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:33:48,509 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:33:48,509 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:33:48,509 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:33:48,509 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:33:48,509 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:33:48,513 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:33:48,513 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:33:48,514 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:33:48,514 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:33:48,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:33:48,514 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:33:48,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:33:48,515 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:33:48,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:33:48,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:33:48,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:33:48,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:33:48,518 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:33:48,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:33:48,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:33:48,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:33:48,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:33:48,519 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:33:48,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:33:48,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:33:48,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:33:48,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:33:48,520 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:33:48,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:33:48,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:33:48,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:33:48,521 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:33:48,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:33:48,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:33:48,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:33:48,577 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:33:48,577 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:33:48,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-01-07 21:33:48,578 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-07 21:33:48,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:33:48,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:33:48,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:33:48,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:33:48,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:33:48,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:33:48,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:33:48,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:33:48,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:33:48,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/1) ... [2019-01-07 21:33:48,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:33:48,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:33:48,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:33:48,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:33:48,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (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-01-07 21:33:48,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:33:48,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:33:49,076 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:33:49,077 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-07 21:33:49,078 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:33:49 BoogieIcfgContainer [2019-01-07 21:33:49,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:33:49,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:33:49,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:33:49,083 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:33:49,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:33:48" (1/2) ... [2019-01-07 21:33:49,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570c0974 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:33:49, skipping insertion in model container [2019-01-07 21:33:49,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:33:49" (2/2) ... [2019-01-07 21:33:49,086 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-07 21:33:49,096 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:33:49,105 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-07 21:33:49,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-07 21:33:49,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:33:49,158 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:33:49,158 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:33:49,158 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:33:49,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:33:49,159 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:33:49,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:33:49,159 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:33:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-07 21:33:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 21:33:49,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:49,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 21:33:49,195 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:49,203 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-07 21:33:49,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:49,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:49,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:49,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:49,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:33:49,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:33:49,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:33:49,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:33:49,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:33:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:33:49,486 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-07 21:33:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:49,658 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-07 21:33:49,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:33:49,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 21:33:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:49,674 INFO L225 Difference]: With dead ends: 21 [2019-01-07 21:33:49,674 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 21:33:49,678 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-01-07 21:33:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 21:33:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-07 21:33:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 21:33:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-07 21:33:49,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-07 21:33:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:49,720 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-07 21:33:49,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:33:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-07 21:33:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:33:49,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:49,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:33:49,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:49,722 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-07 21:33:49,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:49,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:49,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:49,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:49,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:49,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:33:49,893 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-07 21:33:49,930 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:49,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:50,010 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:50,011 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:33:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:50,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:50,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:50,019 INFO 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-01-07 21:33:50,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:50,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:50,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:50,154 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 15 treesize of output 18 [2019-01-07 21:33:50,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,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, 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 24 [2019-01-07 21:33:50,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,281 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 20 treesize of output 34 [2019-01-07 21:33:50,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,335 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 22 treesize of output 45 [2019-01-07 21:33:50,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:50,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:50,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:50,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:50,827 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-01-07 21:33:50,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:50,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:50,892 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-01-07 21:33:50,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:50,949 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-01-07 21:33:50,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:51,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:51,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:51,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:33:51,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:51,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:33:51,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:33:51,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:51,131 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-07 21:33:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:51,498 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-07 21:33:51,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:33:51,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:33:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:51,501 INFO L225 Difference]: With dead ends: 31 [2019-01-07 21:33:51,501 INFO L226 Difference]: Without dead ends: 28 [2019-01-07 21:33:51,503 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-01-07 21:33:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-07 21:33:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-07 21:33:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 21:33:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-07 21:33:51,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-07 21:33:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:51,510 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-07 21:33:51,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:33:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-07 21:33:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:33:51,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:51,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:33:51,511 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-07 21:33:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:51,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:51,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:51,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:33:51,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:33:51,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:33:51,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:33:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:33:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:33:51,569 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-07 21:33:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:51,633 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-07 21:33:51,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:33:51,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 21:33:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:51,634 INFO L225 Difference]: With dead ends: 15 [2019-01-07 21:33:51,634 INFO L226 Difference]: Without dead ends: 14 [2019-01-07 21:33:51,635 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-01-07 21:33:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-07 21:33:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-07 21:33:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 21:33:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-07 21:33:51,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-07 21:33:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:51,639 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-07 21:33:51,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:33:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-07 21:33:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:33:51,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:51,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:33:51,641 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:51,641 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-07 21:33:51,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:51,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:51,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:51,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:51,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:51,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:51,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:51,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:33:51,707 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-07 21:33:51,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:51,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:51,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:51,729 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:33:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:51,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:51,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:51,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:33:51,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:51,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:51,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:51,794 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 15 treesize of output 18 [2019-01-07 21:33:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:51,811 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 18 treesize of output 24 [2019-01-07 21:33:51,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:51,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:51,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 20 treesize of output 34 [2019-01-07 21:33:51,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:51,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:51,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:51,979 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 22 treesize of output 45 [2019-01-07 21:33:51,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,204 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-01-07 21:33:52,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:52,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,264 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-01-07 21:33:52,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,300 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-01-07 21:33:52,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:52,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:52,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:33:52,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:33:52,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:33:52,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:33:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:33:52,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:52,362 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-07 21:33:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:52,422 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-07 21:33:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:33:52,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 21:33:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:52,424 INFO L225 Difference]: With dead ends: 18 [2019-01-07 21:33:52,424 INFO L226 Difference]: Without dead ends: 17 [2019-01-07 21:33:52,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-07 21:33:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-07 21:33:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 21:33:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-07 21:33:52,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-07 21:33:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:52,431 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-07 21:33:52,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:33:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-07 21:33:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:33:52,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:52,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:33:52,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-07 21:33:52,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:52,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:52,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:52,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:52,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:52,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:52,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:52,512 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:33:52,512 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-07 21:33:52,582 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:52,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:52,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:52,592 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:33:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:52,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:52,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:52,596 INFO 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-01-07 21:33:52,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:52,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:52,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:52,643 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 15 treesize of output 18 [2019-01-07 21:33:52,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,669 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 18 treesize of output 24 [2019-01-07 21:33:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,678 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 20 treesize of output 34 [2019-01-07 21:33:52,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-07 21:33:52,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,754 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-01-07 21:33:52,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:52,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:52,815 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-01-07 21:33:52,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:52,905 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-01-07 21:33:52,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:52,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:33:53,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:53,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:33:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:33:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:53,013 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-07 21:33:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:53,191 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-07 21:33:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:33:53,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:33:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:53,193 INFO L225 Difference]: With dead ends: 32 [2019-01-07 21:33:53,193 INFO L226 Difference]: Without dead ends: 31 [2019-01-07 21:33:53,194 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-01-07 21:33:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-07 21:33:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-07 21:33:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-07 21:33:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-07 21:33:53,200 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-07 21:33:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:53,201 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-07 21:33:53,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:33:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-07 21:33:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:53,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:53,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:53,202 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-07 21:33:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:53,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:53,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:53,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:53,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:53,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:53,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:53,270 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:53,270 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-07 21:33:53,272 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:53,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:53,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:53,284 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:33:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:53,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:53,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:53,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:33:53,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:53,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:53,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:53,308 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 15 treesize of output 18 [2019-01-07 21:33:53,316 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 18 treesize of output 20 [2019-01-07 21:33:53,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:33:53,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,356 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:33:53,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,450 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-01-07 21:33:53,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-07 21:33:53,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,539 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-01-07 21:33:53,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,564 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-01-07 21:33:53,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:33:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:53,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:53,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:33:53,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:33:53,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:33:53,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:33:53,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:33:53,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:53,624 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-07 21:33:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:53,671 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-07 21:33:53,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:33:53,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 21:33:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:53,672 INFO L225 Difference]: With dead ends: 22 [2019-01-07 21:33:53,672 INFO L226 Difference]: Without dead ends: 21 [2019-01-07 21:33:53,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-07 21:33:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-07 21:33:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-07 21:33:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-07 21:33:53,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-07 21:33:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:53,680 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-07 21:33:53,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:33:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-07 21:33:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:53,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:53,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:53,681 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:53,681 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-07 21:33:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:53,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:53,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:53,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:53,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:53,796 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-07 21:33:53,798 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:53,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:53,804 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:53,804 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:33:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:53,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:53,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:53,805 INFO 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-01-07 21:33:53,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:53,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:53,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:53,851 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 15 treesize of output 18 [2019-01-07 21:33:53,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,861 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 18 treesize of output 24 [2019-01-07 21:33:53,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,869 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 20 treesize of output 34 [2019-01-07 21:33:53,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,880 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 22 treesize of output 45 [2019-01-07 21:33:53,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:53,943 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-01-07 21:33:53,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:53,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:53,976 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-01-07 21:33:53,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:54,046 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-01-07 21:33:54,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:54,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,080 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:33:54,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, 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-01-07 21:33:54,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:54,177 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-01-07 21:33:54,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:33:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:54,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:54,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:54,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:33:54,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:54,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:33:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:33:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:33:54,250 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-07 21:33:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:54,560 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-07 21:33:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:33:54,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:33:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:54,562 INFO L225 Difference]: With dead ends: 37 [2019-01-07 21:33:54,562 INFO L226 Difference]: Without dead ends: 36 [2019-01-07 21:33:54,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:33:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-07 21:33:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-07 21:33:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:33:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-07 21:33:54,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-07 21:33:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:54,570 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-07 21:33:54,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:33:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-07 21:33:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:54,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:54,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:54,571 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-07 21:33:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:54,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:54,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:54,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:54,690 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:54,690 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-07 21:33:54,694 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:54,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:54,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:54,702 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:33:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:54,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:54,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:54,703 INFO 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-01-07 21:33:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:54,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:54,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:54,725 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 15 treesize of output 18 [2019-01-07 21:33:54,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,735 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 18 treesize of output 24 [2019-01-07 21:33:54,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,743 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 20 treesize of output 34 [2019-01-07 21:33:54,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,757 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 22 treesize of output 45 [2019-01-07 21:33:54,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:54,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:54,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:54,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:54,816 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-01-07 21:33:54,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:54,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:54,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,022 INFO L303 Elim1Store]: Index analysis took 184 ms [2019-01-07 21:33:55,024 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-01-07 21:33:55,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:55,257 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-01-07 21:33:55,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:55,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:55,383 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-01-07 21:33:55,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:55,428 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-01-07 21:33:55,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:33:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:55,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:55,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:55,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:33:55,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:55,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:33:55,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:33:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:33:55,557 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-07 21:33:55,816 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-07 21:33:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:56,014 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-01-07 21:33:56,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:33:56,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:33:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:56,016 INFO L225 Difference]: With dead ends: 42 [2019-01-07 21:33:56,016 INFO L226 Difference]: Without dead ends: 38 [2019-01-07 21:33:56,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:33:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-07 21:33:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-01-07 21:33:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-07 21:33:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-01-07 21:33:56,027 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-01-07 21:33:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:56,028 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-01-07 21:33:56,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:33:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-01-07 21:33:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:56,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:56,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:56,029 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-07 21:33:56,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:56,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:56,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:56,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:56,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:56,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:56,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:56,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:56,200 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-07 21:33:56,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:56,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:56,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:56,208 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:33:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:56,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:56,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:56,209 INFO 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-01-07 21:33:56,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:56,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:56,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:56,232 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 15 treesize of output 18 [2019-01-07 21:33:56,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,244 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 18 treesize of output 24 [2019-01-07 21:33:56,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,254 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 20 treesize of output 34 [2019-01-07 21:33:56,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,285 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 22 treesize of output 45 [2019-01-07 21:33:56,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:56,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:56,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:56,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:56,344 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-01-07 21:33:56,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:56,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,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, 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-01-07 21:33:56,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:56,479 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-01-07 21:33:56,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:56,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:56,516 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-01-07 21:33:56,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:56,585 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-01-07 21:33:56,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:56,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:56,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:56,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:33:56,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:56,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:33:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:33:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:33:56,666 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-01-07 21:33:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:57,066 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-01-07 21:33:57,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:33:57,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:33:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:57,067 INFO L225 Difference]: With dead ends: 51 [2019-01-07 21:33:57,067 INFO L226 Difference]: Without dead ends: 48 [2019-01-07 21:33:57,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:33:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-07 21:33:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-01-07 21:33:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-07 21:33:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-07 21:33:57,079 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-07 21:33:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:57,080 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-07 21:33:57,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:33:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-07 21:33:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:57,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:57,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:57,081 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-07 21:33:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:57,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:57,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:57,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:57,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:57,180 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-07 21:33:57,186 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:57,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:57,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:57,192 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:33:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:57,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:57,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:57,193 INFO 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-01-07 21:33:57,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:57,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:57,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:57,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:33:57,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,222 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 18 treesize of output 24 [2019-01-07 21:33:57,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,235 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 20 treesize of output 34 [2019-01-07 21:33:57,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,251 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 22 treesize of output 45 [2019-01-07 21:33:57,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,327 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-01-07 21:33:57,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:57,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,469 INFO L303 Elim1Store]: Index analysis took 124 ms [2019-01-07 21:33:57,471 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-01-07 21:33:57,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,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-01-07 21:33:57,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:57,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:57,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:57,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:33:57,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:57,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:33:57,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:33:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:57,609 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-01-07 21:33:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:57,732 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-01-07 21:33:57,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:33:57,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 21:33:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:57,734 INFO L225 Difference]: With dead ends: 36 [2019-01-07 21:33:57,735 INFO L226 Difference]: Without dead ends: 35 [2019-01-07 21:33:57,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:33:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-07 21:33:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-07 21:33:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:33:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-01-07 21:33:57,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-01-07 21:33:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:57,746 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-01-07 21:33:57,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:33:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-01-07 21:33:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:57,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:57,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:57,747 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-07 21:33:57,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:57,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:57,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:57,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:57,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:57,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:57,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:57,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:57,846 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-07 21:33:57,847 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:57,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:57,852 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:57,852 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:33:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:57,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:57,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:57,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:33:57,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:57,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:57,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:57,876 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 15 treesize of output 18 [2019-01-07 21:33:57,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,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, 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 24 [2019-01-07 21:33:57,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,930 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 20 treesize of output 34 [2019-01-07 21:33:57,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:57,945 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 22 treesize of output 45 [2019-01-07 21:33:57,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:57,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:58,009 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-01-07 21:33:58,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:58,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,039 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-01-07 21:33:58,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:58,071 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-01-07 21:33:58,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:58,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,106 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-01-07 21:33:58,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:58,145 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-01-07 21:33:58,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:58,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:58,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:33:58,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:58,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:33:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:33:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:33:58,212 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-01-07 21:33:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:58,699 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-01-07 21:33:58,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:33:58,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:33:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:58,700 INFO L225 Difference]: With dead ends: 55 [2019-01-07 21:33:58,701 INFO L226 Difference]: Without dead ends: 54 [2019-01-07 21:33:58,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:33:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-07 21:33:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-01-07 21:33:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-07 21:33:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-01-07 21:33:58,717 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-01-07 21:33:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:58,718 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-01-07 21:33:58,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:33:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-01-07 21:33:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:58,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:58,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:58,719 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-07 21:33:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:58,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:58,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:58,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:58,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:58,824 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-07 21:33:58,827 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:58,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:58,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:58,832 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:33:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:58,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:58,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:58,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:33:58,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:58,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:58,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:58,854 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 15 treesize of output 18 [2019-01-07 21:33:58,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,862 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 18 treesize of output 24 [2019-01-07 21:33:58,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,871 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 20 treesize of output 34 [2019-01-07 21:33:58,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,885 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 22 treesize of output 45 [2019-01-07 21:33:58,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:58,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:58,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:58,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:58,947 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-01-07 21:33:58,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:33:58,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:58,978 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-01-07 21:33:58,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:59,010 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-01-07 21:33:59,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:33:59,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,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, 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-01-07 21:33:59,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:59,107 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-01-07 21:33:59,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:33:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:59,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:59,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:59,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:33:59,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:59,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:33:59,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:33:59,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:33:59,175 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-01-07 21:33:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:59,485 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-01-07 21:33:59,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:33:59,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:33:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:59,486 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:33:59,486 INFO L226 Difference]: Without dead ends: 54 [2019-01-07 21:33:59,487 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-01-07 21:33:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-07 21:33:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-01-07 21:33:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 21:33:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-07 21:33:59,497 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-07 21:33:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:59,497 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-07 21:33:59,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:33:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-07 21:33:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:33:59,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:59,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:33:59,498 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-07 21:33:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:59,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:59,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:59,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:59,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:59,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:33:59,598 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-07 21:33:59,600 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:33:59,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:33:59,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:33:59,607 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:33:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:59,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:33:59,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:59,608 INFO 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-01-07 21:33:59,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:59,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:59,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:59,629 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 15 treesize of output 18 [2019-01-07 21:33:59,634 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 18 treesize of output 20 [2019-01-07 21:33:59,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:33:59,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,654 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:33:59,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:59,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:59,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:59,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:59,717 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-01-07 21:33:59,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-07 21:33:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:33:59,848 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-01-07 21:33:59,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:59,868 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-01-07 21:33:59,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:33:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:59,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:59,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:59,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:33:59,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:59,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:33:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:33:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:33:59,916 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-01-07 21:34:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:00,041 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-01-07 21:34:00,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:34:00,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 21:34:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:00,042 INFO L225 Difference]: With dead ends: 48 [2019-01-07 21:34:00,042 INFO L226 Difference]: Without dead ends: 47 [2019-01-07 21:34:00,043 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-01-07 21:34:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-07 21:34:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-07 21:34:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 21:34:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-07 21:34:00,052 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-07 21:34:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:00,052 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-07 21:34:00,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:34:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-07 21:34:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:00,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:00,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:00,053 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-07 21:34:00,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:00,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:00,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:00,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:00,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:00,149 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-07 21:34:00,150 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:00,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:00,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:00,154 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:00,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:00,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:00,155 INFO 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-01-07 21:34:00,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:00,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:00,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:00,180 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 15 treesize of output 18 [2019-01-07 21:34:00,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,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, 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 24 [2019-01-07 21:34:00,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,198 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 20 treesize of output 34 [2019-01-07 21:34:00,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,209 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 22 treesize of output 45 [2019-01-07 21:34:00,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:00,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:00,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:00,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:00,271 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-01-07 21:34:00,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:00,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,307 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-01-07 21:34:00,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:00,336 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-01-07 21:34:00,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:00,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:00,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 33 treesize of output 59 [2019-01-07 21:34:00,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:00,426 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-01-07 21:34:00,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:00,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:00,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:00,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:00,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:00,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:00,519 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-01-07 21:34:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:00,818 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-01-07 21:34:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:00,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:34:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:00,820 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:34:00,820 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:34:00,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:34:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-07 21:34:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-07 21:34:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-07 21:34:00,832 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-07 21:34:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:00,832 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-07 21:34:00,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-07 21:34:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:00,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:00,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:00,834 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-07 21:34:00,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:00,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:00,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:00,998 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-01-07 21:34:01,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-01-07 21:34:01,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:01,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:01,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:01,088 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-07 21:34:01,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:01,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:01,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:01,095 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:01,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:01,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:01,095 INFO 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-01-07 21:34:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:01,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:01,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:01,121 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 15 treesize of output 18 [2019-01-07 21:34:01,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,127 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 18 treesize of output 24 [2019-01-07 21:34:01,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,136 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 20 treesize of output 34 [2019-01-07 21:34:01,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,147 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 22 treesize of output 45 [2019-01-07 21:34:01,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:01,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:01,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:01,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:01,199 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-01-07 21:34:01,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:01,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,254 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-01-07 21:34:01,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:01,280 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-01-07 21:34:01,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:01,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,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, 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-01-07 21:34:01,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:01,344 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-01-07 21:34:01,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:01,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,387 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:01,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:01,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, 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-01-07 21:34:01,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:01,427 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-01-07 21:34:01,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:01,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:01,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:01,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:01,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:01,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:01,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:01,536 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-01-07 21:34:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:02,065 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-01-07 21:34:02,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:34:02,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:34:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:02,066 INFO L225 Difference]: With dead ends: 76 [2019-01-07 21:34:02,066 INFO L226 Difference]: Without dead ends: 75 [2019-01-07 21:34:02,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-07 21:34:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-01-07 21:34:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 21:34:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-07 21:34:02,079 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-07 21:34:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:02,079 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-07 21:34:02,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-07 21:34:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:02,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:02,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:02,080 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-07 21:34:02,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:02,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:02,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:02,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:02,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:02,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:02,261 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:02,261 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-07 21:34:02,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:02,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:02,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:02,268 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:02,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:02,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:02,269 INFO 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-01-07 21:34:02,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:02,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:02,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:02,296 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 15 treesize of output 18 [2019-01-07 21:34:02,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,300 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 18 treesize of output 24 [2019-01-07 21:34:02,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,307 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 20 treesize of output 34 [2019-01-07 21:34:02,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,318 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 22 treesize of output 45 [2019-01-07 21:34:02,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,369 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:02,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,528 INFO L303 Elim1Store]: Index analysis took 116 ms [2019-01-07 21:34:02,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, 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-01-07 21:34:02,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,555 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-01-07 21:34:02,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:02,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,593 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:02,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 33 treesize of output 60 [2019-01-07 21:34:02,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,621 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-01-07 21:34:02,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:02,846 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-07 21:34:02,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:02,916 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 69 [2019-01-07 21:34:02,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:02,952 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-01-07 21:34:02,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:02,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:03,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:03,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:03,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:03,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:03,030 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-07 21:34:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:03,516 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-01-07 21:34:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:03,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:34:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:03,518 INFO L225 Difference]: With dead ends: 67 [2019-01-07 21:34:03,518 INFO L226 Difference]: Without dead ends: 65 [2019-01-07 21:34:03,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:34:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-07 21:34:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-01-07 21:34:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-07 21:34:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-07 21:34:03,530 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-07 21:34:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:03,530 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-07 21:34:03,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-07 21:34:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:03,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:03,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:03,531 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-07 21:34:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:03,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:03,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:03,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:03,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:03,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:03,665 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-07 21:34:03,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:03,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:03,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:03,672 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:03,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:03,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:03,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:03,673 INFO 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-01-07 21:34:03,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:03,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:03,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:03,717 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 15 treesize of output 18 [2019-01-07 21:34:03,753 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 18 treesize of output 20 [2019-01-07 21:34:03,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:34:03,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,785 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:34:03,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:03,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:03,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:03,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:03,832 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-01-07 21:34:03,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-07 21:34:03,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,860 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-01-07 21:34:03,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:03,876 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-01-07 21:34:03,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:03,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:03,904 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-01-07 21:34:03,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:03,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-01-07 21:34:03,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:34:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:03,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:03,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:03,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:03,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:03,985 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-01-07 21:34:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:04,198 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-01-07 21:34:04,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:04,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:34:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:04,199 INFO L225 Difference]: With dead ends: 58 [2019-01-07 21:34:04,199 INFO L226 Difference]: Without dead ends: 57 [2019-01-07 21:34:04,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-01-07 21:34:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-07 21:34:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-07 21:34:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 21:34:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-07 21:34:04,211 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-07 21:34:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-07 21:34:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-07 21:34:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:04,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:04,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:04,213 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-01-07 21:34:04,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:04,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:04,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:04,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:04,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:04,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:04,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:04,371 INFO 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-01-07 21:34:04,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:04,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:04,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:34:04,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:04,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:34:04,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,399 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 18 treesize of output 24 [2019-01-07 21:34:04,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,405 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 20 treesize of output 34 [2019-01-07 21:34:04,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,418 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 22 treesize of output 45 [2019-01-07 21:34:04,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:04,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:04,450 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:04,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:04,472 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-01-07 21:34:04,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:04,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,503 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-01-07 21:34:04,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:04,552 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-01-07 21:34:04,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:04,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,604 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-01-07 21:34:04,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:04,651 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-01-07 21:34:04,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:04,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,679 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:04,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:04,681 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-01-07 21:34:04,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:04,713 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-01-07 21:34:04,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:04,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:04,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:04,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:04,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:04,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:04,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:04,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:04,788 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-07 21:34:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:05,176 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-01-07 21:34:05,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:34:05,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:34:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:05,185 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:34:05,185 INFO L226 Difference]: Without dead ends: 70 [2019-01-07 21:34:05,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-07 21:34:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-01-07 21:34:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:34:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-07 21:34:05,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-01-07 21:34:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:05,198 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-07 21:34:05,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-07 21:34:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:05,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:05,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:05,199 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-07 21:34:05,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:05,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:05,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:05,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:05,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:05,426 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-07 21:34:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:05,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:34:05,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:34:05,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:34:05,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:34:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:34:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:34:05,434 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-01-07 21:34:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:05,745 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-01-07 21:34:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:34:05,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 21:34:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:05,746 INFO L225 Difference]: With dead ends: 36 [2019-01-07 21:34:05,746 INFO L226 Difference]: Without dead ends: 33 [2019-01-07 21:34:05,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:34:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-07 21:34:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-07 21:34:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:34:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-01-07 21:34:05,761 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-01-07 21:34:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:05,761 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-01-07 21:34:05,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:34:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-01-07 21:34:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:05,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:05,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:05,766 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:05,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-07 21:34:05,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:05,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:05,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:05,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:05,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-01-07 21:34:05,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:05,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:05,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:05,872 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-07 21:34:05,873 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:05,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:05,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:05,878 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:05,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:05,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:05,879 INFO 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-01-07 21:34:05,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:05,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:05,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:05,912 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 15 treesize of output 18 [2019-01-07 21:34:05,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:05,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, 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 24 [2019-01-07 21:34:05,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:05,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:05,943 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 20 treesize of output 34 [2019-01-07 21:34:05,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:05,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:05,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:05,950 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 22 treesize of output 45 [2019-01-07 21:34:05,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:05,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:05,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:05,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:06,010 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-01-07 21:34:06,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:06,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,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, 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-01-07 21:34:06,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:06,071 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-01-07 21:34:06,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:06,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:06,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 31 treesize of output 65 [2019-01-07 21:34:06,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:06,512 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-01-07 21:34:06,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:06,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:06,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:06,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:34:06,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:06,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:34:06,679 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-01-07 21:34:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:06,864 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-01-07 21:34:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:06,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:34:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:06,865 INFO L225 Difference]: With dead ends: 44 [2019-01-07 21:34:06,865 INFO L226 Difference]: Without dead ends: 43 [2019-01-07 21:34:06,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-07 21:34:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-07 21:34:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-07 21:34:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-01-07 21:34:06,879 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-01-07 21:34:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:06,880 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-01-07 21:34:06,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-01-07 21:34:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:06,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:06,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:06,881 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-07 21:34:06,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:06,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:07,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:07,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:07,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:07,050 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-07 21:34:07,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:07,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:07,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:07,054 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:07,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:07,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:07,055 INFO 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-01-07 21:34:07,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:07,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:07,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:07,077 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 15 treesize of output 18 [2019-01-07 21:34:07,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,079 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 18 treesize of output 24 [2019-01-07 21:34:07,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,086 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 20 treesize of output 34 [2019-01-07 21:34:07,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,097 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 22 treesize of output 45 [2019-01-07 21:34:07,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,161 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-01-07 21:34:07,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:07,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,239 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-01-07 21:34:07,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,270 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-01-07 21:34:07,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:07,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,321 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:07,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, 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-01-07 21:34:07,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,350 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-01-07 21:34:07,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:07,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:07,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:07,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:07,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:07,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:07,411 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-01-07 21:34:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:07,699 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-01-07 21:34:07,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:07,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:34:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:07,701 INFO L225 Difference]: With dead ends: 49 [2019-01-07 21:34:07,701 INFO L226 Difference]: Without dead ends: 48 [2019-01-07 21:34:07,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-07 21:34:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-01-07 21:34:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-07 21:34:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-01-07 21:34:07,716 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-01-07 21:34:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:07,717 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-01-07 21:34:07,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-01-07 21:34:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:07,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:07,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:07,718 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-07 21:34:07,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:07,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:07,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:07,944 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-07 21:34:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:07,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:07,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:07,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:07,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:07,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:07,954 INFO 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-01-07 21:34:07,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:07,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:07,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 21:34:07,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:07,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:07,973 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 15 treesize of output 18 [2019-01-07 21:34:07,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,976 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 18 treesize of output 24 [2019-01-07 21:34:07,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,984 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 20 treesize of output 34 [2019-01-07 21:34:07,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:07,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-07 21:34:07,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:08,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:08,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:08,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:08,058 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-01-07 21:34:08,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:08,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,255 INFO L303 Elim1Store]: Index analysis took 178 ms [2019-01-07 21:34:08,256 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-01-07 21:34:08,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:08,613 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-01-07 21:34:08,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:08,813 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-07 21:34:08,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:08,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:09,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:09,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:09,051 INFO L303 Elim1Store]: Index analysis took 234 ms [2019-01-07 21:34:09,051 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-01-07 21:34:09,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:09,338 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-01-07 21:34:09,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:09,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:09,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:09,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:09,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:09,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:09,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:09,399 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-01-07 21:34:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:09,974 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-01-07 21:34:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:09,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:34:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:09,977 INFO L225 Difference]: With dead ends: 58 [2019-01-07 21:34:09,977 INFO L226 Difference]: Without dead ends: 57 [2019-01-07 21:34:09,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:34:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-07 21:34:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-01-07 21:34:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 21:34:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-01-07 21:34:09,994 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-01-07 21:34:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:09,994 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-01-07 21:34:09,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-01-07 21:34:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:09,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:09,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:09,995 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-01-07 21:34:09,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:09,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:09,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:09,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:09,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:10,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:10,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:10,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:10,099 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-01-07 21:34:10,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:10,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:10,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:10,105 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:10,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:10,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:10,105 INFO 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-01-07 21:34:10,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:10,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:10,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:10,143 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 15 treesize of output 18 [2019-01-07 21:34:10,149 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 18 treesize of output 20 [2019-01-07 21:34:10,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:34:10,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,177 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:34:10,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:10,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:10,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:10,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:10,217 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-01-07 21:34:10,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-07 21:34:10,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,247 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-01-07 21:34:10,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:10,263 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-01-07 21:34:10,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:10,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:10,444 INFO L303 Elim1Store]: Index analysis took 159 ms [2019-01-07 21:34:10,445 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-01-07 21:34:10,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:10,716 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-01-07 21:34:10,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:34:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:10,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:11,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-01-07 21:34:11,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:11,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:11,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:11,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:11,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:11,320 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-01-07 21:34:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:11,791 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-01-07 21:34:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:11,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:34:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:11,792 INFO L225 Difference]: With dead ends: 59 [2019-01-07 21:34:11,793 INFO L226 Difference]: Without dead ends: 58 [2019-01-07 21:34:11,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:34:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-07 21:34:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-01-07 21:34:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:34:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-01-07 21:34:11,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-01-07 21:34:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:11,809 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-01-07 21:34:11,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-01-07 21:34:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:11,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:11,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:11,811 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-01-07 21:34:11,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:11,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:11,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:11,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:11,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:11,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:11,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:11,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:11,906 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-01-07 21:34:11,907 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:11,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:11,911 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:11,911 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:34:11,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:11,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:11,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:11,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:11,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:11,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:11,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:11,958 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 15 treesize of output 18 [2019-01-07 21:34:11,988 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 18 treesize of output 20 [2019-01-07 21:34:12,054 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 20 treesize of output 22 [2019-01-07 21:34:12,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,176 INFO L303 Elim1Store]: Index analysis took 121 ms [2019-01-07 21:34:12,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-07 21:34:12,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,212 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-01-07 21:34:12,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-01-07 21:34:12,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,230 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 21 [2019-01-07 21:34:12,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,239 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-01-07 21:34:12,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-07 21:34:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:12,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:12,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:34:12,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-07 21:34:12,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:34:12,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:34:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:34:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:34:12,273 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-01-07 21:34:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:12,586 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-01-07 21:34:12,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:34:12,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 21:34:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:12,587 INFO L225 Difference]: With dead ends: 74 [2019-01-07 21:34:12,587 INFO L226 Difference]: Without dead ends: 73 [2019-01-07 21:34:12,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:34:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-07 21:34:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-01-07 21:34:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-07 21:34:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-01-07 21:34:12,606 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-01-07 21:34:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:12,607 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-01-07 21:34:12,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:34:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-01-07 21:34:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:34:12,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:12,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:34:12,608 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-01-07 21:34:12,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:12,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:12,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:12,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:12,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:12,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:12,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:12,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:34:12,733 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-07 21:34:12,734 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:12,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:12,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:12,737 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:12,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:12,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:12,738 INFO 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-01-07 21:34:12,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:12,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:12,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:12,758 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 15 treesize of output 18 [2019-01-07 21:34:12,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,766 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 18 treesize of output 24 [2019-01-07 21:34:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,772 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 20 treesize of output 34 [2019-01-07 21:34:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,783 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 22 treesize of output 45 [2019-01-07 21:34:12,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,846 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-01-07 21:34:12,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:12,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,873 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-01-07 21:34:12,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,903 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-01-07 21:34:12,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:12,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:12,930 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:12,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, 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-01-07 21:34:12,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:12,961 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-01-07 21:34:12,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:13,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:13,203 INFO L303 Elim1Store]: Index analysis took 221 ms [2019-01-07 21:34:13,203 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-01-07 21:34:13,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:13,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-01-07 21:34:13,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:13,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:13,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:13,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:34:13,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:13,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:13,327 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-01-07 21:34:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:13,743 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-01-07 21:34:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:13,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:34:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:13,745 INFO L225 Difference]: With dead ends: 105 [2019-01-07 21:34:13,746 INFO L226 Difference]: Without dead ends: 97 [2019-01-07 21:34:13,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:34:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-07 21:34:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-01-07 21:34:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 21:34:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-01-07 21:34:13,765 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-01-07 21:34:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:13,766 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-01-07 21:34:13,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-01-07 21:34:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:13,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:13,766 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-07 21:34:13,767 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-01-07 21:34:13,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:13,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:13,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:13,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:13,905 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-07 21:34:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:13,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:13,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:13,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:13,911 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-07 21:34:13,911 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:13,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:13,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:13,916 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:34:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:13,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:13,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:13,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:13,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:13,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:13,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:13,942 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 15 treesize of output 18 [2019-01-07 21:34:13,950 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 18 treesize of output 20 [2019-01-07 21:34:13,959 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 20 treesize of output 22 [2019-01-07 21:34:14,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:14,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-07 21:34:14,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:14,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:14,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:14,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:14,053 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-01-07 21:34:14,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-07 21:34:14,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:14,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:14,172 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-01-07 21:34:14,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:14,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:14,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 21:34:14,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:14,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:14,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:14,545 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-01-07 21:34:14,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:14,582 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-01-07 21:34:14,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-07 21:34:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:14,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:14,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:14,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:34:14,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:14,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:34:14,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:34:14,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:34:14,674 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-01-07 21:34:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:14,834 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-01-07 21:34:14,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:14,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-07 21:34:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:14,836 INFO L225 Difference]: With dead ends: 85 [2019-01-07 21:34:14,836 INFO L226 Difference]: Without dead ends: 80 [2019-01-07 21:34:14,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-07 21:34:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-07 21:34:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 21:34:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-07 21:34:14,858 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-07 21:34:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:14,858 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-07 21:34:14,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:34:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-07 21:34:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:14,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:14,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:14,859 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-07 21:34:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:14,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:14,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:14,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:14,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:14,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:14,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:14,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:14,969 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-07 21:34:14,970 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:14,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:14,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:14,979 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:14,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:14,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:14,979 INFO 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-01-07 21:34:14,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:14,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:14,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:14,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:34:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,005 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 18 treesize of output 24 [2019-01-07 21:34:15,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,009 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 20 treesize of output 34 [2019-01-07 21:34:15,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,015 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 22 treesize of output 45 [2019-01-07 21:34:15,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,120 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-01-07 21:34:15,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,223 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-01-07 21:34:15,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,250 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-01-07 21:34:15,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:15,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,287 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-01-07 21:34:15,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,318 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-01-07 21:34:15,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:15,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:15,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:15,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:15,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:15,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:15,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:15,378 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-01-07 21:34:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:15,606 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-01-07 21:34:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:15,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:34:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:15,608 INFO L225 Difference]: With dead ends: 83 [2019-01-07 21:34:15,608 INFO L226 Difference]: Without dead ends: 82 [2019-01-07 21:34:15,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-07 21:34:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-01-07 21:34:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 21:34:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-07 21:34:15,628 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-07 21:34:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:15,628 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-07 21:34:15,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-07 21:34:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:15,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:15,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:15,629 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-07 21:34:15,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:15,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:15,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:15,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:15,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:15,815 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:15,815 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-07 21:34:15,816 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:15,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:15,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:15,819 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:15,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:15,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:15,819 INFO 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-01-07 21:34:15,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:15,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:15,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:15,841 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 15 treesize of output 18 [2019-01-07 21:34:15,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,845 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 18 treesize of output 24 [2019-01-07 21:34:15,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,851 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 20 treesize of output 34 [2019-01-07 21:34:15,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,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 22 treesize of output 45 [2019-01-07 21:34:15,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:15,938 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-01-07 21:34:15,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:15,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:15,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,009 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-01-07 21:34:16,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:16,040 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-01-07 21:34:16,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:16,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,096 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-01-07 21:34:16,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:16,127 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-01-07 21:34:16,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:16,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,157 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:16,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:16,160 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-01-07 21:34:16,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:16,199 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-01-07 21:34:16,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:16,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:16,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:16,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:34:16,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:16,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:16,319 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-07 21:34:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:16,718 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-01-07 21:34:16,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:16,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:34:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:16,721 INFO L225 Difference]: With dead ends: 97 [2019-01-07 21:34:16,721 INFO L226 Difference]: Without dead ends: 96 [2019-01-07 21:34:16,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-07 21:34:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-01-07 21:34:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 21:34:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-07 21:34:16,745 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-07 21:34:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:16,746 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-07 21:34:16,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-07 21:34:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:16,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:16,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:16,747 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:16,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:16,748 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-07 21:34:16,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:16,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:16,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:16,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:16,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:16,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:16,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:16,957 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-07 21:34:16,958 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:16,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:16,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:16,963 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:16,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:16,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:16,964 INFO 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-01-07 21:34:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:16,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:16,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:17,002 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 15 treesize of output 18 [2019-01-07 21:34:17,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,014 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 18 treesize of output 24 [2019-01-07 21:34:17,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,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 20 treesize of output 34 [2019-01-07 21:34:17,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,032 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 22 treesize of output 45 [2019-01-07 21:34:17,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:17,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,137 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-01-07 21:34:17,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,163 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-01-07 21:34:17,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:17,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,200 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-01-07 21:34:17,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,231 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-01-07 21:34:17,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:17,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:17,265 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:17,266 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-01-07 21:34:17,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:17,303 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-01-07 21:34:17,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:17,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:17,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:17,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:17,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:17,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:17,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:17,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:17,390 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-07 21:34:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:17,780 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-01-07 21:34:17,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:17,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:34:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:17,782 INFO L225 Difference]: With dead ends: 102 [2019-01-07 21:34:17,782 INFO L226 Difference]: Without dead ends: 101 [2019-01-07 21:34:17,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:34:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-07 21:34:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-01-07 21:34:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-07 21:34:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-01-07 21:34:17,808 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-01-07 21:34:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:17,809 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-01-07 21:34:17,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-01-07 21:34:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:17,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:17,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:17,810 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-01-07 21:34:17,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:17,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:17,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:18,021 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:34:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:18,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:18,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:18,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:18,064 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-01-07 21:34:18,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:18,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:18,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:18,069 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:18,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:18,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:18,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:18,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:18,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:18,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:18,086 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 15 treesize of output 18 [2019-01-07 21:34:18,089 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 18 treesize of output 20 [2019-01-07 21:34:18,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:34:18,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,105 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:34:18,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:18,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:18,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:18,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:18,146 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-01-07 21:34:18,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-07 21:34:18,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,176 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-01-07 21:34:18,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:18,192 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-01-07 21:34:18,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:18,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,214 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:18,215 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-01-07 21:34:18,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:18,233 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-01-07 21:34:18,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-01-07 21:34:18,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:18,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, 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 44 [2019-01-07 21:34:18,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:18,276 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-01-07 21:34:18,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-07 21:34:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:18,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:18,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:18,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:18,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:18,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:18,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:18,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:18,344 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-01-07 21:34:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:18,950 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-01-07 21:34:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:34:18,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:34:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:18,953 INFO L225 Difference]: With dead ends: 108 [2019-01-07 21:34:18,953 INFO L226 Difference]: Without dead ends: 107 [2019-01-07 21:34:18,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-07 21:34:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-01-07 21:34:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:34:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-01-07 21:34:18,981 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-01-07 21:34:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:18,981 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-01-07 21:34:18,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-01-07 21:34:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:18,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:18,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:18,982 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-01-07 21:34:18,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:18,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:18,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:18,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:18,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:19,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:19,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:19,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:19,125 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-07 21:34:19,127 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:19,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:19,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:19,129 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:34:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:19,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:19,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:19,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:19,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:19,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:19,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:34:19,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,154 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 18 treesize of output 24 [2019-01-07 21:34:19,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,167 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 20 treesize of output 34 [2019-01-07 21:34:19,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,175 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 22 treesize of output 45 [2019-01-07 21:34:19,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:19,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,253 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-01-07 21:34:19,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,280 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-01-07 21:34:19,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:19,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:19,311 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-01-07 21:34:19,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,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-01-07 21:34:19,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:19,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,393 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 69 [2019-01-07 21:34:19,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,423 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-01-07 21:34:19,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:19,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:19,457 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:19,458 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-01-07 21:34:19,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,498 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-01-07 21:34:19,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:19,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:19,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:19,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:34:19,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:19,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:34:19,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:34:19,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:19,713 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-01-07 21:34:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:21,334 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-01-07 21:34:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:21,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:34:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:21,336 INFO L225 Difference]: With dead ends: 120 [2019-01-07 21:34:21,336 INFO L226 Difference]: Without dead ends: 119 [2019-01-07 21:34:21,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:34:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-07 21:34:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-01-07 21:34:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-07 21:34:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-01-07 21:34:21,368 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-01-07 21:34:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:21,368 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-01-07 21:34:21,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:34:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-01-07 21:34:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:21,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:21,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:21,369 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-01-07 21:34:21,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:21,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:21,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:21,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:21,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:21,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:21,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:21,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:21,596 INFO 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-01-07 21:34:21,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:21,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:21,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:34:21,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:21,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:21,619 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 15 treesize of output 18 [2019-01-07 21:34:21,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,622 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 18 treesize of output 24 [2019-01-07 21:34:21,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,626 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 20 treesize of output 34 [2019-01-07 21:34:21,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,639 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 22 treesize of output 45 [2019-01-07 21:34:21,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:21,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,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-01-07 21:34:21,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,745 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-01-07 21:34:21,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:21,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,779 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-01-07 21:34:21,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,812 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-01-07 21:34:21,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:21,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,852 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:21,853 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-01-07 21:34:21,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,885 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-01-07 21:34:21,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:21,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,918 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:21,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:21,920 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-01-07 21:34:21,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:21,954 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-01-07 21:34:21,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:21,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:34:22,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:22,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:34:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:34:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:34:22,048 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-01-07 21:34:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:22,637 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-01-07 21:34:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:22,637 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:34:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:22,639 INFO L225 Difference]: With dead ends: 146 [2019-01-07 21:34:22,639 INFO L226 Difference]: Without dead ends: 145 [2019-01-07 21:34:22,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:34:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-07 21:34:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-01-07 21:34:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-07 21:34:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-01-07 21:34:22,665 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-01-07 21:34:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:22,665 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-01-07 21:34:22,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:34:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-01-07 21:34:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:22,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:22,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:22,667 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-07 21:34:22,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:22,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:22,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:22,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:22,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:22,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:22,773 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-07 21:34:22,774 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:22,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:22,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:22,779 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:22,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:22,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:22,780 INFO 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-01-07 21:34:22,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:22,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:22,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:22,797 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 15 treesize of output 18 [2019-01-07 21:34:22,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,802 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 18 treesize of output 24 [2019-01-07 21:34:22,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,810 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 20 treesize of output 34 [2019-01-07 21:34:22,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,824 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 22 treesize of output 45 [2019-01-07 21:34:22,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:22,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:22,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:22,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:22,880 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-01-07 21:34:22,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:22,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,907 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-01-07 21:34:22,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:22,936 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-01-07 21:34:22,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:22,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:22,964 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-01-07 21:34:22,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:22,997 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-01-07 21:34:22,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:23,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:23,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:23,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:34:23,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:23,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:34:23,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:34:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:34:23,056 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-01-07 21:34:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:23,275 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-01-07 21:34:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:23,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-07 21:34:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:23,277 INFO L225 Difference]: With dead ends: 111 [2019-01-07 21:34:23,278 INFO L226 Difference]: Without dead ends: 110 [2019-01-07 21:34:23,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:34:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-07 21:34:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-01-07 21:34:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-07 21:34:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-01-07 21:34:23,306 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-01-07 21:34:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:23,306 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-01-07 21:34:23,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:34:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-01-07 21:34:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:23,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:23,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:23,308 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:23,308 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-07 21:34:23,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:23,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:23,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:23,550 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-07 21:34:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:23,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:23,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:23,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:23,591 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-07 21:34:23,593 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:23,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:23,596 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:23,596 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:23,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:23,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:23,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:23,597 INFO 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-01-07 21:34:23,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:23,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:23,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:23,617 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 15 treesize of output 18 [2019-01-07 21:34:23,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,622 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 18 treesize of output 24 [2019-01-07 21:34:23,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,630 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 20 treesize of output 34 [2019-01-07 21:34:23,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,639 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 22 treesize of output 45 [2019-01-07 21:34:23,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:23,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:23,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:23,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:23,694 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-01-07 21:34:23,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:23,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,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, 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-01-07 21:34:23,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:23,776 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-01-07 21:34:23,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:23,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,807 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:23,811 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-01-07 21:34:23,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:23,841 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-01-07 21:34:23,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:23,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:23,872 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-01-07 21:34:23,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:23,959 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-01-07 21:34:23,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:23,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:24,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-01-07 21:34:24,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:24,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:34:24,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:24,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:24,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:24,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:24,024 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-01-07 21:34:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:24,446 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-01-07 21:34:24,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:24,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:34:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:24,449 INFO L225 Difference]: With dead ends: 153 [2019-01-07 21:34:24,449 INFO L226 Difference]: Without dead ends: 152 [2019-01-07 21:34:24,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-07 21:34:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-01-07 21:34:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-07 21:34:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-01-07 21:34:24,514 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-01-07 21:34:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:24,515 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-01-07 21:34:24,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-01-07 21:34:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:24,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:24,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:24,516 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:24,516 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-07 21:34:24,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:24,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:24,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:24,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:24,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:24,631 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:24,632 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-07 21:34:24,634 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:24,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:24,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:24,637 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:24,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:24,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:24,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:24,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:24,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:24,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:34:24,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, 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 20 [2019-01-07 21:34:24,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:34:24,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,724 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:34:24,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:24,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:24,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:24,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:24,765 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-01-07 21:34:24,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-07 21:34:24,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,797 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-01-07 21:34:24,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:24,814 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-01-07 21:34:24,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:24,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:24,838 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:24,839 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-01-07 21:34:24,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:24,856 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-01-07 21:34:24,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:34:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:24,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:24,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:24,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:24,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:24,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:24,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:24,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:24,936 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-01-07 21:34:25,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:25,168 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-01-07 21:34:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:25,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:34:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:25,171 INFO L225 Difference]: With dead ends: 143 [2019-01-07 21:34:25,171 INFO L226 Difference]: Without dead ends: 138 [2019-01-07 21:34:25,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-07 21:34:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-01-07 21:34:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-07 21:34:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-01-07 21:34:25,205 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-01-07 21:34:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:25,205 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-01-07 21:34:25,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-01-07 21:34:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:25,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:25,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:25,206 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-07 21:34:25,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:25,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:25,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:25,693 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2019-01-07 21:34:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:25,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:25,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:25,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:25,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:25,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:25,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:25,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:25,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:25,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:34:25,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:25,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:25,865 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 15 treesize of output 18 [2019-01-07 21:34:25,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,868 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 18 treesize of output 24 [2019-01-07 21:34:25,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,871 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 20 treesize of output 34 [2019-01-07 21:34:25,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,877 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 22 treesize of output 45 [2019-01-07 21:34:25,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:25,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:25,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:25,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:25,947 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-01-07 21:34:25,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:25,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:25,986 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-01-07 21:34:25,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:26,025 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-01-07 21:34:26,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:26,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,088 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-01-07 21:34:26,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:26,132 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-01-07 21:34:26,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:26,163 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:26,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, 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-01-07 21:34:26,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:26,194 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-01-07 21:34:26,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:26,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:26,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:26,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:34:26,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:26,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:26,314 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-01-07 21:34:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:26,727 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-01-07 21:34:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:34:26,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:34:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:26,729 INFO L225 Difference]: With dead ends: 196 [2019-01-07 21:34:26,729 INFO L226 Difference]: Without dead ends: 195 [2019-01-07 21:34:26,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:34:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-07 21:34:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-01-07 21:34:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-07 21:34:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-01-07 21:34:26,774 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-01-07 21:34:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:26,774 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-01-07 21:34:26,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-01-07 21:34:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:26,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:26,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:26,775 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-01-07 21:34:26,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:26,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:26,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:26,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:26,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:27,038 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-07 21:34:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:27,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:27,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:27,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:27,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:27,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:27,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 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-01-07 21:34:27,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:34:27,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:34:27,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:34:27,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:27,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:27,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:34:27,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,136 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 18 treesize of output 24 [2019-01-07 21:34:27,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,144 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 20 treesize of output 34 [2019-01-07 21:34:27,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,150 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 22 treesize of output 45 [2019-01-07 21:34:27,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:27,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,227 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-01-07 21:34:27,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,254 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-01-07 21:34:27,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:27,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,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 33 treesize of output 67 [2019-01-07 21:34:27,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,318 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-01-07 21:34:27,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:27,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,374 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:27,375 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-01-07 21:34:27,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,409 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-01-07 21:34:27,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:27,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:27,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:27,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, 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-01-07 21:34:27,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:27,476 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-01-07 21:34:27,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:27,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:27,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:27,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:34:27,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:27,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:34:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:34:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:27,558 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-01-07 21:34:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:28,055 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-01-07 21:34:28,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:34:28,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:34:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:28,058 INFO L225 Difference]: With dead ends: 205 [2019-01-07 21:34:28,059 INFO L226 Difference]: Without dead ends: 197 [2019-01-07 21:34:28,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:34:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-07 21:34:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-01-07 21:34:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-07 21:34:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-07 21:34:28,101 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-07 21:34:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:28,101 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-07 21:34:28,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:34:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-07 21:34:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:28,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:28,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:28,102 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:28,102 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-07 21:34:28,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:28,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:28,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:28,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:28,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:28,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:28,195 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-07 21:34:28,196 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:28,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:28,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:28,199 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:28,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:28,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:28,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 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-01-07 21:34:28,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:28,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:28,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:28,220 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 15 treesize of output 18 [2019-01-07 21:34:28,224 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 18 treesize of output 20 [2019-01-07 21:34:28,237 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 20 treesize of output 22 [2019-01-07 21:34:28,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-07 21:34:28,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,287 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-01-07 21:34:28,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-07 21:34:28,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,310 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 21 [2019-01-07 21:34:28,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 21:34:28,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:34:28,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,345 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-01-07 21:34:28,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-07 21:34:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:28,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:28,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:28,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:28,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:28,395 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-07 21:34:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:28,568 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-01-07 21:34:28,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:28,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:34:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:28,569 INFO L225 Difference]: With dead ends: 165 [2019-01-07 21:34:28,570 INFO L226 Difference]: Without dead ends: 164 [2019-01-07 21:34:28,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-01-07 21:34:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-07 21:34:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-01-07 21:34:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-07 21:34:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-07 21:34:28,613 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-07 21:34:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:28,614 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-07 21:34:28,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-07 21:34:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:34:28,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:28,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:34:28,615 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-01-07 21:34:28,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:28,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:28,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:28,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:28,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:28,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:28,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:28,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:34:28,692 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-01-07 21:34:28,693 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:28,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:28,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:28,695 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:28,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:28,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:28,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:28,695 INFO 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-01-07 21:34:28,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:28,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:28,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:28,715 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 15 treesize of output 18 [2019-01-07 21:34:28,717 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 18 treesize of output 20 [2019-01-07 21:34:28,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:34:28,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,737 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:34:28,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,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-01-07 21:34:28,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-07 21:34:28,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,808 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-01-07 21:34:28,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,823 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-01-07 21:34:28,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:28,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:28,846 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 48 [2019-01-07 21:34:28,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:28,865 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-01-07 21:34:28,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:28,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:28,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:28,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:28,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:28,920 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-07 21:34:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:29,168 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-01-07 21:34:29,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:29,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:34:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:29,170 INFO L225 Difference]: With dead ends: 174 [2019-01-07 21:34:29,170 INFO L226 Difference]: Without dead ends: 173 [2019-01-07 21:34:29,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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-01-07 21:34:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-07 21:34:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-01-07 21:34:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-07 21:34:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-01-07 21:34:29,224 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-01-07 21:34:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:29,225 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-01-07 21:34:29,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-01-07 21:34:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:29,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:29,226 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-07 21:34:29,226 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:29,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-01-07 21:34:29,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:29,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:29,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:29,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:29,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:29,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:29,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:29,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:29,416 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-01-07 21:34:29,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:29,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:29,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:29,419 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:34:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:29,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:29,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:29,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:29,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:29,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:29,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:29,440 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 15 treesize of output 18 [2019-01-07 21:34:29,442 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 18 treesize of output 20 [2019-01-07 21:34:29,447 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 20 treesize of output 22 [2019-01-07 21:34:29,466 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-07 21:34:29,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,503 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-01-07 21:34:29,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-01-07 21:34:29,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:29,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, 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-01-07 21:34:29,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-07 21:34:29,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:29,617 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-01-07 21:34:29,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:29,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-07 21:34:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:29,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:29,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:34:29,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-01-07 21:34:29,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:34:29,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 21:34:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 21:34:29,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:34:29,660 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-01-07 21:34:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:29,817 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-01-07 21:34:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:34:29,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-07 21:34:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:29,821 INFO L225 Difference]: With dead ends: 357 [2019-01-07 21:34:29,821 INFO L226 Difference]: Without dead ends: 353 [2019-01-07 21:34:29,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:34:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-07 21:34:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-01-07 21:34:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-07 21:34:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-01-07 21:34:29,959 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-01-07 21:34:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:29,960 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-01-07 21:34:29,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 21:34:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-01-07 21:34:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:29,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:29,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:29,961 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-01-07 21:34:29,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:29,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:29,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:30,226 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-07 21:34:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:30,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:30,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:30,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:30,362 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-07 21:34:30,363 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:30,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:30,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:30,366 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:30,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:30,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:30,368 INFO 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-01-07 21:34:30,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:30,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:30,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:30,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 15 treesize of output 18 [2019-01-07 21:34:30,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,429 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 18 treesize of output 24 [2019-01-07 21:34:30,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,461 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 20 treesize of output 34 [2019-01-07 21:34:30,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,538 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 22 treesize of output 45 [2019-01-07 21:34:30,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:30,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:30,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:30,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:30,654 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-01-07 21:34:30,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:30,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,681 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-01-07 21:34:30,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:30,711 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-01-07 21:34:30,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:30,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 33 treesize of output 59 [2019-01-07 21:34:30,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:30,775 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-01-07 21:34:30,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:30,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:30,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:30,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:34:30,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:30,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:30,960 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-01-07 21:34:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:31,319 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-01-07 21:34:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:31,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:34:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:31,325 INFO L225 Difference]: With dead ends: 348 [2019-01-07 21:34:31,325 INFO L226 Difference]: Without dead ends: 338 [2019-01-07 21:34:31,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:34:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-07 21:34:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-01-07 21:34:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-07 21:34:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-01-07 21:34:31,421 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-01-07 21:34:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:31,421 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-01-07 21:34:31,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-01-07 21:34:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:31,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:31,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:31,423 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:31,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-07 21:34:31,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:31,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:31,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:31,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:31,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:31,996 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-07 21:34:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:32,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:32,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:32,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:32,064 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-07 21:34:32,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:32,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:32,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:32,067 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:32,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:32,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:32,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:32,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:32,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:32,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:32,092 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 15 treesize of output 18 [2019-01-07 21:34:32,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,094 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 18 treesize of output 24 [2019-01-07 21:34:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,099 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 20 treesize of output 34 [2019-01-07 21:34:32,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,104 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 22 treesize of output 45 [2019-01-07 21:34:32,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:32,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,274 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-07 21:34:32,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, 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-01-07 21:34:32,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,301 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-01-07 21:34:32,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,334 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-01-07 21:34:32,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,363 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-01-07 21:34:32,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:32,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:32,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:32,392 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-01-07 21:34:32,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:32,426 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-01-07 21:34:32,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:32,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:32,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:32,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:32,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:32,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:32,500 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-01-07 21:34:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:32,916 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-01-07 21:34:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:32,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:34:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:32,919 INFO L225 Difference]: With dead ends: 348 [2019-01-07 21:34:32,919 INFO L226 Difference]: Without dead ends: 343 [2019-01-07 21:34:32,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:34:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-07 21:34:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-01-07 21:34:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-07 21:34:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-01-07 21:34:33,026 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-01-07 21:34:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:33,026 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-01-07 21:34:33,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-01-07 21:34:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:33,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:33,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:33,028 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:33,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:33,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-07 21:34:33,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:33,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:33,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:33,221 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:34:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:33,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:33,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:33,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:33,306 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-07 21:34:33,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:33,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:33,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:33,309 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:34:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:33,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:33,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:33,310 INFO 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-01-07 21:34:33,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:33,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:33,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:33,329 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 15 treesize of output 18 [2019-01-07 21:34:33,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,332 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 18 treesize of output 24 [2019-01-07 21:34:33,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,338 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 20 treesize of output 34 [2019-01-07 21:34:33,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-07 21:34:33,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:33,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,425 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-01-07 21:34:33,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,450 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-01-07 21:34:33,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,483 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-01-07 21:34:33,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,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-01-07 21:34:33,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:33,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,564 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:33,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 77 [2019-01-07 21:34:33,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,599 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-01-07 21:34:33,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:33,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,631 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:33,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:33,633 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-01-07 21:34:33,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,669 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-01-07 21:34:33,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:33,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:33,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:33,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:34:33,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:33,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:34:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:34:33,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:33,757 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-01-07 21:34:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:34,365 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-01-07 21:34:34,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:34:34,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:34:34,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:34,370 INFO L225 Difference]: With dead ends: 457 [2019-01-07 21:34:34,370 INFO L226 Difference]: Without dead ends: 456 [2019-01-07 21:34:34,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:34:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-01-07 21:34:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-01-07 21:34:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-07 21:34:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-01-07 21:34:34,497 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-01-07 21:34:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:34,497 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-01-07 21:34:34,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:34:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-01-07 21:34:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:34,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:34,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:34,499 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-07 21:34:34,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:34,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:34,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:34,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:34,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:34,785 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2019-01-07 21:34:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:34,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:34,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:34,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:34,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:34,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:34,858 INFO 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-01-07 21:34:34,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:34,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:34,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:34:34,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:34,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:34,882 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 15 treesize of output 18 [2019-01-07 21:34:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,885 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 18 treesize of output 24 [2019-01-07 21:34:34,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,890 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 20 treesize of output 34 [2019-01-07 21:34:34,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-07 21:34:34,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:34,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:34,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:34,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:34,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:34,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:34,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:34,978 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-01-07 21:34:34,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:35,004 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-01-07 21:34:35,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:35,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,036 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:35,037 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-01-07 21:34:35,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:35,066 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-01-07 21:34:35,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:35,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,098 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-01-07 21:34:35,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:35,130 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-01-07 21:34:35,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:35,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:35,164 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:35,165 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-01-07 21:34:35,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:35,202 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-01-07 21:34:35,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:35,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:35,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:35,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:34:35,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:35,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:34:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:34:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:35,295 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-01-07 21:34:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:35,812 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-01-07 21:34:35,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:35,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-07 21:34:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:35,818 INFO L225 Difference]: With dead ends: 346 [2019-01-07 21:34:35,818 INFO L226 Difference]: Without dead ends: 345 [2019-01-07 21:34:35,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:34:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-07 21:34:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-01-07 21:34:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-07 21:34:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-01-07 21:34:35,899 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-01-07 21:34:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:35,899 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-01-07 21:34:35,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:34:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-01-07 21:34:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:35,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:35,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:35,900 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-01-07 21:34:35,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:35,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:35,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:35,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:36,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:36,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:36,021 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:36,021 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-07 21:34:36,022 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:36,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:36,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:36,025 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:36,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:36,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:36,026 INFO 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-01-07 21:34:36,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:36,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:36,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:36,044 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 15 treesize of output 18 [2019-01-07 21:34:36,052 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 18 treesize of output 20 [2019-01-07 21:34:36,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:34:36,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,070 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:34:36,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:36,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:36,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:36,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:36,110 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-01-07 21:34:36,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-07 21:34:36,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,147 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-01-07 21:34:36,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:36,168 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-01-07 21:34:36,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:36,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,203 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:36,204 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-01-07 21:34:36,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:36,232 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-01-07 21:34:36,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-01-07 21:34:36,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:36,264 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 44 [2019-01-07 21:34:36,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:36,290 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-01-07 21:34:36,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-07 21:34:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:36,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:36,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:36,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:34:36,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:36,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:36,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:36,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:36,411 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-01-07 21:34:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:36,820 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-01-07 21:34:36,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:36,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:34:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:36,823 INFO L225 Difference]: With dead ends: 280 [2019-01-07 21:34:36,823 INFO L226 Difference]: Without dead ends: 277 [2019-01-07 21:34:36,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-07 21:34:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-01-07 21:34:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-07 21:34:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-01-07 21:34:36,924 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-01-07 21:34:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:36,925 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-01-07 21:34:36,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-01-07 21:34:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:36,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:36,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:36,926 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-01-07 21:34:36,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:36,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:36,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:37,258 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-07 21:34:37,479 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-07 21:34:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:37,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:37,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:37,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:37,502 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-01-07 21:34:37,503 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:37,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:37,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:37,506 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:37,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:37,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:37,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:37,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:37,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:37,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:37,525 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 15 treesize of output 18 [2019-01-07 21:34:37,528 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 18 treesize of output 20 [2019-01-07 21:34:37,535 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 20 treesize of output 22 [2019-01-07 21:34:37,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:37,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-07 21:34:37,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:37,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:37,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:37,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:37,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-01-07 21:34:37,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-07 21:34:37,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:37,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:37,598 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-01-07 21:34:37,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:37,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:37,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 21:34:37,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:37,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:37,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:37,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:37,622 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-01-07 21:34:37,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:37,633 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-01-07 21:34:37,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-07 21:34:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:37,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:37,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-07 21:34:37,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:37,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:34:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:34:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:34:37,681 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-01-07 21:34:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:38,027 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-01-07 21:34:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:34:38,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-07 21:34:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:38,030 INFO L225 Difference]: With dead ends: 390 [2019-01-07 21:34:38,031 INFO L226 Difference]: Without dead ends: 377 [2019-01-07 21:34:38,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:34:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-07 21:34:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-01-07 21:34:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-07 21:34:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-01-07 21:34:38,176 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-01-07 21:34:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:38,177 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-01-07 21:34:38,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:34:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-01-07 21:34:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:38,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:38,178 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-07 21:34:38,179 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:38,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:38,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-01-07 21:34:38,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:38,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:38,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:38,492 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-07 21:34:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:38,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:38,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:38,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:38,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:38,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:38,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:38,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:38,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:38,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:38,603 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 15 treesize of output 18 [2019-01-07 21:34:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,605 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 18 treesize of output 24 [2019-01-07 21:34:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,609 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 20 treesize of output 34 [2019-01-07 21:34:38,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,614 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 22 treesize of output 45 [2019-01-07 21:34:38,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:38,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,689 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-01-07 21:34:38,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:38,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,747 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-01-07 21:34:38,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,778 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-01-07 21:34:38,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:38,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,811 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:38,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, 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-01-07 21:34:38,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,843 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-01-07 21:34:38,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:38,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,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, 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-01-07 21:34:38,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,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-01-07 21:34:38,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:34:38,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:38,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, 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-01-07 21:34:38,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:38,986 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-01-07 21:34:38,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:39,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:39,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:39,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-07 21:34:39,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:39,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:34:39,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:34:39,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:34:39,106 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-01-07 21:34:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:39,757 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-01-07 21:34:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:34:39,758 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-07 21:34:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:39,762 INFO L225 Difference]: With dead ends: 375 [2019-01-07 21:34:39,762 INFO L226 Difference]: Without dead ends: 374 [2019-01-07 21:34:39,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:34:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-07 21:34:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-01-07 21:34:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-07 21:34:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-01-07 21:34:39,885 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-01-07 21:34:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:39,885 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-01-07 21:34:39,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:34:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-01-07 21:34:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:39,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:39,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:39,886 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-01-07 21:34:39,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:39,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:39,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:39,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:39,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:40,037 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-07 21:34:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:40,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:40,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:40,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:40,090 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-07 21:34:40,091 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:40,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:40,093 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:40,094 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:34:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:40,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:40,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:40,095 INFO 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-01-07 21:34:40,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:40,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:40,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:40,113 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 15 treesize of output 18 [2019-01-07 21:34:40,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,152 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 18 treesize of output 24 [2019-01-07 21:34:40,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-07 21:34:40,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,211 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 22 treesize of output 45 [2019-01-07 21:34:40,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:40,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:40,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:40,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:40,260 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-01-07 21:34:40,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:40,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,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, 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-01-07 21:34:40,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:40,315 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-01-07 21:34:40,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:40,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:40,344 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-01-07 21:34:40,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:40,377 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-01-07 21:34:40,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:40,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:40,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:40,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:34:40,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:40,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:34:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:34:40,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:34:40,434 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-01-07 21:34:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:40,726 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-01-07 21:34:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:34:40,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-07 21:34:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:40,728 INFO L225 Difference]: With dead ends: 157 [2019-01-07 21:34:40,728 INFO L226 Difference]: Without dead ends: 150 [2019-01-07 21:34:40,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:34:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-07 21:34:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-07 21:34:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-07 21:34:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-01-07 21:34:40,860 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-01-07 21:34:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:40,860 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-01-07 21:34:40,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:34:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-01-07 21:34:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:40,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:40,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:40,862 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:40,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-07 21:34:40,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:40,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:40,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:41,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:41,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:41,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:34:41,033 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-07 21:34:41,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:41,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:41,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:41,036 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:41,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:41,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:41,036 INFO 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-01-07 21:34:41,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:41,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:41,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:41,065 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 15 treesize of output 18 [2019-01-07 21:34:41,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,069 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 18 treesize of output 24 [2019-01-07 21:34:41,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,077 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 20 treesize of output 34 [2019-01-07 21:34:41,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,088 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 22 treesize of output 45 [2019-01-07 21:34:41,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:41,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:41,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:41,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:41,133 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-01-07 21:34:41,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:41,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,168 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-01-07 21:34:41,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:41,193 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-01-07 21:34:41,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:41,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,221 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:41,222 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-01-07 21:34:41,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:41,253 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-01-07 21:34:41,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:41,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:41,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, 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-01-07 21:34:41,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:41,359 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-01-07 21:34:41,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:41,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:41,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:41,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:41,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:41,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:41,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:41,507 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-01-07 21:34:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:42,069 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-01-07 21:34:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:34:42,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:34:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:42,073 INFO L225 Difference]: With dead ends: 206 [2019-01-07 21:34:42,073 INFO L226 Difference]: Without dead ends: 199 [2019-01-07 21:34:42,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:34:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-07 21:34:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-01-07 21:34:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-07 21:34:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-01-07 21:34:42,306 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-01-07 21:34:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:42,306 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-01-07 21:34:42,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-01-07 21:34:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:34:42,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:42,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:42,307 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:42,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-07 21:34:42,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:42,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:42,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:42,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:42,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:42,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:42,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:42,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:42,481 INFO 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-01-07 21:34:42,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:42,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:42,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:34:42,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:42,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:42,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:34:42,511 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 18 treesize of output 20 [2019-01-07 21:34:42,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-07 21:34:42,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,524 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-07 21:34:42,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:42,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:42,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:42,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:42,563 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-01-07 21:34:42,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-07 21:34:42,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,592 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-01-07 21:34:42,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:42,609 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-01-07 21:34:42,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:34:42,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,632 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-01-07 21:34:42,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:42,650 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-01-07 21:34:42,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-07 21:34:42,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:42,676 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:42,677 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 55 [2019-01-07 21:34:42,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:42,698 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-01-07 21:34:42,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:34:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:42,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:42,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:42,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:34:42,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:42,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:42,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:34:42,766 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-01-07 21:34:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:43,228 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-01-07 21:34:43,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:34:43,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:34:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:43,230 INFO L225 Difference]: With dead ends: 161 [2019-01-07 21:34:43,231 INFO L226 Difference]: Without dead ends: 156 [2019-01-07 21:34:43,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-07 21:34:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-01-07 21:34:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-07 21:34:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-01-07 21:34:43,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-01-07 21:34:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:43,300 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-01-07 21:34:43,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-01-07 21:34:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:34:43,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:43,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:43,301 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-01-07 21:34:43,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:43,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:43,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:43,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:43,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:43,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:43,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:43,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:34:43,452 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-07 21:34:43,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:43,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:43,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:43,455 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:43,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:43,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:43,456 INFO 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-01-07 21:34:43,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:43,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:43,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:43,494 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 15 treesize of output 18 [2019-01-07 21:34:43,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,497 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 18 treesize of output 24 [2019-01-07 21:34:43,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,501 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 20 treesize of output 34 [2019-01-07 21:34:43,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,508 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 22 treesize of output 45 [2019-01-07 21:34:43,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:43,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:43,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:43,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:43,556 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-01-07 21:34:43,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:43,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,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 31 treesize of output 51 [2019-01-07 21:34:43,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:43,610 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-01-07 21:34:43,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:43,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,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, 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-01-07 21:34:43,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:43,669 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-01-07 21:34:43,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:43,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:43,701 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:43,702 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-01-07 21:34:43,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:43,737 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-01-07 21:34:43,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:43,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:43,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:43,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:34:43,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:43,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:43,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:43,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:34:43,809 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-01-07 21:34:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:44,194 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-01-07 21:34:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:34:44,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-07 21:34:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:44,196 INFO L225 Difference]: With dead ends: 62 [2019-01-07 21:34:44,196 INFO L226 Difference]: Without dead ends: 52 [2019-01-07 21:34:44,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-07 21:34:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-07 21:34:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-07 21:34:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-07 21:34:44,315 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-07 21:34:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:44,315 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-07 21:34:44,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-07 21:34:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:34:44,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:44,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:44,316 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-01-07 21:34:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:44,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:44,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:44,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:34:44,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:44,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:44,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:34:44,451 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-01-07 21:34:44,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:44,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:44,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:44,455 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:44,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:44,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:44,455 INFO 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-01-07 21:34:44,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:44,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:44,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:44,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 15 treesize of output 18 [2019-01-07 21:34:44,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,480 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 18 treesize of output 24 [2019-01-07 21:34:44,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,493 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 20 treesize of output 34 [2019-01-07 21:34:44,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,499 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 22 treesize of output 45 [2019-01-07 21:34:44,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:44,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,571 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-01-07 21:34:44,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,597 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-01-07 21:34:44,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:44,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,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, 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-01-07 21:34:44,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,658 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-01-07 21:34:44,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:44,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:44,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:44,690 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-01-07 21:34:44,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,721 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-01-07 21:34:44,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:44,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:44,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:44,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-07 21:34:44,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:44,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:34:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:34:44,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:34:44,796 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-01-07 21:34:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:45,193 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-01-07 21:34:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:34:45,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-07 21:34:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:45,195 INFO L225 Difference]: With dead ends: 59 [2019-01-07 21:34:45,195 INFO L226 Difference]: Without dead ends: 52 [2019-01-07 21:34:45,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:34:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-07 21:34:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-07 21:34:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-07 21:34:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-07 21:34:45,330 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-07 21:34:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:45,330 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-07 21:34:45,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:34:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-07 21:34:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:34:45,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:45,331 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:45,331 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-01-07 21:34:45,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:45,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:34:45,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:45,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:45,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:45,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:45,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:45,502 INFO 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-01-07 21:34:45,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:45,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:45,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:34:45,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:45,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:45,521 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 15 treesize of output 18 [2019-01-07 21:34:45,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,528 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 18 treesize of output 24 [2019-01-07 21:34:45,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,537 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 20 treesize of output 34 [2019-01-07 21:34:45,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,543 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 22 treesize of output 45 [2019-01-07 21:34:45,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,613 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-01-07 21:34:45,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:45,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,641 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-01-07 21:34:45,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,666 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-01-07 21:34:45,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:45,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,697 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-01-07 21:34:45,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,727 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-01-07 21:34:45,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:45,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,763 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-01-07 21:34:45,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,799 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-01-07 21:34:45,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:45,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:45,834 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 89 [2019-01-07 21:34:45,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:45,870 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-01-07 21:34:45,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:45,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:45,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:45,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-07 21:34:45,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:45,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:34:45,983 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-01-07 21:34:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:46,504 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-01-07 21:34:46,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:46,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-07 21:34:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:46,505 INFO L225 Difference]: With dead ends: 67 [2019-01-07 21:34:46,505 INFO L226 Difference]: Without dead ends: 32 [2019-01-07 21:34:46,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:34:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-07 21:34:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-07 21:34:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:34:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-01-07 21:34:46,613 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-01-07 21:34:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:46,613 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-01-07 21:34:46,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-01-07 21:34:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:34:46,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:46,614 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:46,614 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-01-07 21:34:46,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:46,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:46,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:46,765 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:34:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:34:46,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:46,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:46,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:34:46,794 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-01-07 21:34:46,795 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:46,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:46,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:46,798 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:34:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:46,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:46,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:46,799 INFO 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-01-07 21:34:46,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:46,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:46,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:46,816 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 15 treesize of output 18 [2019-01-07 21:34:46,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,820 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 18 treesize of output 24 [2019-01-07 21:34:46,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,825 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 20 treesize of output 34 [2019-01-07 21:34:46,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,830 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 22 treesize of output 45 [2019-01-07 21:34:46,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:46,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:46,859 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:46,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:46,881 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-01-07 21:34:46,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:46,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,909 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-01-07 21:34:46,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:46,935 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-01-07 21:34:46,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:46,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:46,967 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-01-07 21:34:46,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:46,998 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-01-07 21:34:46,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:47,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,027 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-01-07 21:34:47,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:47,057 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-01-07 21:34:47,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:47,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,088 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:47,089 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-01-07 21:34:47,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:47,125 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-01-07 21:34:47,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:47,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:47,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:47,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-07 21:34:47,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:47,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:34:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:34:47,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:34:47,204 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-01-07 21:34:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:47,609 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-01-07 21:34:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:47,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-07 21:34:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:47,611 INFO L225 Difference]: With dead ends: 47 [2019-01-07 21:34:47,611 INFO L226 Difference]: Without dead ends: 40 [2019-01-07 21:34:47,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:34:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-07 21:34:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-07 21:34:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 21:34:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-01-07 21:34:47,743 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-01-07 21:34:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:47,744 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-01-07 21:34:47,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:34:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-01-07 21:34:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:34:47,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:47,744 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:47,744 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-01-07 21:34:47,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:47,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:47,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 21:34:47,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:47,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:47,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:47,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:47,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:47,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 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-01-07 21:34:47,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:47,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:47,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:34:47,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:47,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:47,925 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 15 treesize of output 18 [2019-01-07 21:34:47,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,932 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 18 treesize of output 24 [2019-01-07 21:34:47,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-07 21:34:47,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:47,946 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 22 treesize of output 45 [2019-01-07 21:34:47,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:47,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:47,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:47,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:47,993 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-01-07 21:34:47,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:48,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,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, 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-01-07 21:34:48,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:48,045 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-01-07 21:34:48,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:48,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,077 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-01-07 21:34:48,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:48,108 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-01-07 21:34:48,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:48,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:48,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 33 treesize of output 78 [2019-01-07 21:34:48,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:48,173 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-01-07 21:34:48,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:48,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:48,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, 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-01-07 21:34:48,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:48,241 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-01-07 21:34:48,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:48,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:48,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:48,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:34:48,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:48,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:34:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:34:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:48,330 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-01-07 21:34:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:48,789 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-01-07 21:34:48,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:34:48,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-07 21:34:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:48,792 INFO L225 Difference]: With dead ends: 52 [2019-01-07 21:34:48,792 INFO L226 Difference]: Without dead ends: 45 [2019-01-07 21:34:48,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:34:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-07 21:34:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-07 21:34:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 21:34:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-01-07 21:34:48,935 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-01-07 21:34:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:48,935 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-01-07 21:34:48,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:34:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-01-07 21:34:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:34:48,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:48,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:48,936 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-01-07 21:34:48,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:48,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:48,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:34:49,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:49,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:49,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:34:49,147 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-01-07 21:34:49,148 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:34:49,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:34:49,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:34:49,151 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:34:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:49,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:34:49,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:49,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:34:49,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:49,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:49,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:49,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-07 21:34:49,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,175 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 18 treesize of output 24 [2019-01-07 21:34:49,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,208 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 20 treesize of output 34 [2019-01-07 21:34:49,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,213 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 22 treesize of output 45 [2019-01-07 21:34:49,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:49,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,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, 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-01-07 21:34:49,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,359 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-01-07 21:34:49,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,582 INFO L303 Elim1Store]: Index analysis took 204 ms [2019-01-07 21:34:49,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, 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-01-07 21:34:49,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,613 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-01-07 21:34:49,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,645 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:49,646 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-01-07 21:34:49,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,679 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-01-07 21:34:49,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:49,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:49,711 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:49,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, 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-01-07 21:34:49,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:49,746 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-01-07 21:34:49,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:49,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:49,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:49,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:34:49,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:49,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:34:49,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:34:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:34:49,998 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-01-07 21:34:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:50,557 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-01-07 21:34:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:34:50,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-07 21:34:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:50,558 INFO L225 Difference]: With dead ends: 66 [2019-01-07 21:34:50,558 INFO L226 Difference]: Without dead ends: 56 [2019-01-07 21:34:50,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:34:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-07 21:34:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-07 21:34:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 21:34:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-01-07 21:34:50,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-01-07 21:34:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:50,738 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-01-07 21:34:50,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:34:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-01-07 21:34:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:34:50,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:50,739 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:34:50,739 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:50,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:50,739 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-01-07 21:34:50,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:50,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:50,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:50,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:50,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:34:50,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:50,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:50,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:50,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:50,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:50,988 INFO 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-01-07 21:34:50,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:50,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:51,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:34:51,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:51,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:51,011 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 15 treesize of output 18 [2019-01-07 21:34:51,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,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, 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 24 [2019-01-07 21:34:51,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,023 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 20 treesize of output 34 [2019-01-07 21:34:51,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,036 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 22 treesize of output 45 [2019-01-07 21:34:51,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-07 21:34:51,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,114 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-01-07 21:34:51,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,142 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-01-07 21:34:51,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:34:51,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,235 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:34:51,236 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-01-07 21:34:51,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,265 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-01-07 21:34:51,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-07 21:34:51,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,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, 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-01-07 21:34:51,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,326 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-01-07 21:34:51,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:51,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,362 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-01-07 21:34:51,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,396 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-01-07 21:34:51,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:51,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:34:51,432 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-01-07 21:34:51,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:51,469 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-01-07 21:34:51,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:34:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:51,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:51,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:51,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-01-07 21:34:51,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:51,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:34:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:34:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:34:51,660 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-01-07 21:34:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:52,329 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-01-07 21:34:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:34:52,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-07 21:34:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:52,330 INFO L225 Difference]: With dead ends: 48 [2019-01-07 21:34:52,330 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 21:34:52,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:34:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 21:34:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 21:34:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 21:34:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 21:34:52,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-07 21:34:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:52,332 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 21:34:52,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:34:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 21:34:52,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 21:34:52,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 21:34:52,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:52,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:53,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:54,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:55,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:55,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:55,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:55,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:55,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:55,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:55,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:56,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:57,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:57,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:57,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:57,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:57,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:57,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:58,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:58,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:58,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:58,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:58,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:59,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:59,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:59,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:34:59,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:00,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:00,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:00,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:00,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:00,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:00,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:00,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:01,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:01,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:01,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:02,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:35:02,378 WARN L181 SmtUtils]: Spent 10.03 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-01-07 21:35:16,317 WARN L181 SmtUtils]: Spent 13.92 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-01-07 21:35:16,321 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-07 21:35:16,321 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-01-07 21:35:16,321 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-07 21:35:16,321 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-07 21:35:16,321 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-01-07 21:35:16,322 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse18 (- 1)))) (.cse19 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (= .cse18 0)) (.cse5 (<= 0 .cse19)) (.cse2 (select .cse17 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse3 (= 0 (select .cse10 ULTIMATE.start_main_p1))) (.cse1 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse19 1)))) (or (and (and (and .cse0 .cse1) (<= 1 .cse2) .cse3) (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse5 (<= 0 .cse6) .cse7 (<= .cse8 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (let ((.cse11 (select .cse4 ULTIMATE.start_main_p2))) (let ((.cse14 (<= .cse18 0)) (.cse15 (<= (+ .cse11 1) 0)) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and (= 0 (select .cse9 ULTIMATE.start_main_p1)) (<= 1 (select .cse10 ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse11) .cse0 .cse7) (and (and .cse12 .cse13 .cse14 .cse5 .cse15 .cse3) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p3))) (and (and .cse14 (let ((.cse16 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select .cse17 ULTIMATE.start_main_p1)) .cse12))) (or (and .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse16) (and .cse15 .cse16)))) (<= 0 .cse2))))) (and .cse0 .cse3 .cse1 (= .cse19 0) .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select .cse9 ULTIMATE.start_main_p4) 1) 0)))))) [2019-01-07 21:35:16,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-07 21:35:16,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-01-07 21:35:16,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-01-07 21:35:16,322 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-01-07 21:35:16,322 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-07 21:35:16,338 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 09:35:16 BoogieIcfgContainer [2019-01-07 21:35:16,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 21:35:16,339 INFO L168 Benchmark]: Toolchain (without parser) took 87722.93 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -785.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-01-07 21:35:16,340 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:35:16,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:35:16,340 INFO L168 Benchmark]: Boogie Preprocessor took 26.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:35:16,340 INFO L168 Benchmark]: RCFGBuilder took 363.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:35:16,341 INFO L168 Benchmark]: TraceAbstraction took 87259.10 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -807.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-01-07 21:35:16,342 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 363.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87259.10 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -807.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((p1 + 3 <= p4 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2)) || ((((((0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p2 == p4)) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && p1 + 3 <= p4) && #memory_int[p4] == 0) || ((((((!(p1 == p4) && !(p1 == p3)) && #memory_int[p4] <= 0) && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && !(p4 == p3))) || ((#memory_int[p4] <= 0 && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)))) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3])) || ((((((p1 + 3 <= p4 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 87.1s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 22.1s AutomataDifference, 0.0s DeadEndRemovalTime, 23.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 20.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 13.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.7s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...