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-df3cc4e-m [2019-01-11 11:10:59,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:10:59,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:10:59,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:10:59,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:10:59,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:10:59,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:10:59,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:10:59,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:10:59,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:10:59,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:10:59,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:10:59,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:10:59,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:10:59,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:10:59,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:10:59,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:10:59,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:10:59,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:10:59,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:10:59,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:10:59,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:10:59,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:10:59,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:10:59,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:10:59,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:10:59,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:10:59,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:10:59,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:10:59,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:10:59,121 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:10:59,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:10:59,122 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:10:59,122 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:10:59,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:10:59,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:10:59,124 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-11 11:10:59,148 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:10:59,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:10:59,150 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:10:59,150 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:10:59,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:10:59,150 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:10:59,151 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:10:59,151 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:10:59,151 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:10:59,151 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:10:59,151 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:10:59,152 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:10:59,152 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:10:59,152 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:10:59,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:10:59,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:10:59,153 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:10:59,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:10:59,155 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:10:59,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:10:59,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:10:59,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:10:59,156 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:10:59,156 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:10:59,156 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:10:59,156 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:10:59,157 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:10:59,157 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:10:59,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:10:59,158 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:10:59,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:10:59,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:10:59,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:10:59,158 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:10:59,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:10:59,159 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:10:59,159 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:10:59,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:10:59,159 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:10:59,159 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:10:59,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:10:59,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:10:59,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:10:59,238 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:10:59,238 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:10:59,239 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-11 11:10:59,239 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-11 11:10:59,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:10:59,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:10:59,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:10:59,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:10:59,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:10:59,305 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,318 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:10:59,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:10:59,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:10:59,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:10:59,353 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,353 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,355 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,355 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,362 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,366 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,367 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 11.01 11:10:59" (1/1) ... [2019-01-11 11:10:59,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:10:59,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:10:59,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:10:59,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:10:59,375 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 11.01 11:10:59" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:10:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:10:59,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:10:59,829 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:10:59,830 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-11 11:10:59,831 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:10:59 BoogieIcfgContainer [2019-01-11 11:10:59,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:10:59,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:10:59,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:10:59,837 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:10:59,838 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 11.01 11:10:59" (1/2) ... [2019-01-11 11:10:59,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc09c4d and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:10:59, skipping insertion in model container [2019-01-11 11:10:59,839 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 11.01 11:10:59" (2/2) ... [2019-01-11 11:10:59,842 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-11 11:10:59,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:10:59,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-11 11:10:59,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-11 11:10:59,905 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:10:59,905 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:10:59,905 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:10:59,906 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:10:59,906 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:10:59,906 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:10:59,906 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:10:59,906 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:10:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-11 11:10:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:10:59,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:59,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:10:59,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-11 11:10:59,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:59,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:59,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:00,139 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-11 11:11:00,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:11:00,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:11:00,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:11:00,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:11:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:11:00,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:11:00,169 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-11 11:11:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:00,375 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-11 11:11:00,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:11:00,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:11:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:00,392 INFO L225 Difference]: With dead ends: 21 [2019-01-11 11:11:00,392 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 11:11:00,395 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-11 11:11:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 11:11:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-11 11:11:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 11:11:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-11 11:11:00,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-11 11:11:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:00,428 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-11 11:11:00,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:11:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-11 11:11:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:11:00,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:00,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:11:00,430 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:00,430 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-11 11:11:00,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:00,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:00,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:00,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:00,589 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-11 11:11:00,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:00,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:00,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:11:00,593 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-11 11:11:00,629 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:00,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:00,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:00,720 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-11 11:11:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:00,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:00,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:00,727 INFO 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-11 11:11:00,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:00,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:00,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:00,855 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-11 11:11:00,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:00,897 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-11 11:11:00,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:00,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 11:11:00,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:00,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:00,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:00,980 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-11 11:11:00,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,332 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-11 11:11:01,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:01,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:01,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:01,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:01,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:01,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:01,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:01,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:01,468 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-11 11:11:01,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,520 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-11 11:11:01,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:01,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-11 11:11:01,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:01,626 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-11 11:11:01,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:01,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:11:01,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:01,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:11:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:11:01,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:11:01,650 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-11 11:11:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:02,076 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-11 11:11:02,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:11:02,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:11:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:02,080 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:11:02,080 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 11:11:02,082 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-11 11:11:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 11:11:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-11 11:11:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:11:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-11 11:11:02,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-11 11:11:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:02,090 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-11 11:11:02,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:11:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-11 11:11:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:11:02,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:02,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:11:02,093 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-11 11:11:02,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:02,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:02,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:02,125 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-11 11:11:02,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:11:02,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:11:02,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:11:02,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:11:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:11:02,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:11:02,127 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-11 11:11:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:02,169 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-11 11:11:02,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:11:02,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 11:11:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:02,170 INFO L225 Difference]: With dead ends: 15 [2019-01-11 11:11:02,170 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 11:11:02,171 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-11 11:11:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 11:11:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-11 11:11:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:11:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-11 11:11:02,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-11 11:11:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:02,176 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-11 11:11:02,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:11:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-11 11:11:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:11:02,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:02,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:11:02,177 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-11 11:11:02,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:02,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:02,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:02,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:02,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:02,288 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-11 11:11:02,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:02,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:02,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:11:02,289 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-11 11:11:02,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:02,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:02,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:02,301 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-11 11:11:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:02,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:02,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:02,302 INFO 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-11 11:11:02,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:02,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:02,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:02,327 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-11 11:11:02,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,340 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-11 11:11:02,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,389 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-11 11:11:02,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,474 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-11 11:11:02,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:02,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:02,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:02,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:02,756 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-11 11:11:02,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:02,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:02,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:11:02,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:02,854 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-11 11:11:02,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:02,873 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-11 11:11:02,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:02,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:11:02,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:11:02,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:11:02,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:11:02,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:11:02,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:11:02,918 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-11 11:11:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:03,001 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-11 11:11:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:11:03,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:11:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:03,002 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:11:03,002 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:11:03,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:11:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:11:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-11 11:11:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:11:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-11 11:11:03,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-11 11:11:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:03,009 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-11 11:11:03,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:11:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-11 11:11:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:11:03,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:03,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:11:03,010 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:03,010 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-11 11:11:03,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:03,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:03,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:03,096 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-11 11:11:03,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:03,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:03,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:11:03,098 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-11 11:11:03,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:03,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:03,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:03,107 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-11 11:11:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:03,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:03,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:03,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:03,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:03,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:03,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:03,128 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-11 11:11:03,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,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-11 11:11:03,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,220 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-11 11:11:03,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,250 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-11 11:11:03,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,321 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-11 11:11:03,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:03,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,379 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-11 11:11:03,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,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-11 11:11:03,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:03,467 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-11 11:11:03,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:03,500 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-11 11:11:03,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:03,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:11:03,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:03,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:11:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:11:03,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:11:03,519 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-11 11:11:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:03,699 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-11 11:11:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:11:03,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:11:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:03,701 INFO L225 Difference]: With dead ends: 32 [2019-01-11 11:11:03,701 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 11:11:03,701 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-11 11:11:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 11:11:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-11 11:11:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:11:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-11 11:11:03,707 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-11 11:11:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:03,707 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-11 11:11:03,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:11:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-11 11:11:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:03,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:03,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:03,708 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-11 11:11:03,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:03,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:03,786 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-11 11:11:03,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:03,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:03,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:03,787 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-11 11:11:03,789 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:03,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:03,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:03,801 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-11 11:11:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:03,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:03,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:03,802 INFO 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-11 11:11:03,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:03,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:03,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:03,826 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-11 11:11:03,834 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-11 11:11:03,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 11:11:03,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:03,872 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-11 11:11:03,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:03,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:11:03,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:04,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,018 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-11 11:11:04,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,041 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-11 11:11:04,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:04,058 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-11 11:11:04,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:04,077 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-11 11:11:04,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:11:04,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:11:04,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:11:04,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:11:04,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:11:04,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:11:04,097 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-11 11:11:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:04,144 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-11 11:11:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:11:04,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:11:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:04,146 INFO L225 Difference]: With dead ends: 22 [2019-01-11 11:11:04,146 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 11:11:04,146 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-11 11:11:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 11:11:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-11 11:11:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 11:11:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-11 11:11:04,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-11 11:11:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:04,152 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-11 11:11:04,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:11:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-11 11:11:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:04,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:04,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:04,154 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-11 11:11:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:04,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:04,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:04,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:04,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:04,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:04,268 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-11 11:11:04,270 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:04,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:04,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:04,276 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-11 11:11:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:04,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:04,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:04,277 INFO 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-11 11:11:04,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:04,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:04,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:04,304 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-11 11:11:04,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,310 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-11 11:11:04,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,323 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-11 11:11:04,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,334 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-11 11:11:04,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,401 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-11 11:11:04,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:04,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,459 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-11 11:11:04,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,513 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-11 11:11:04,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:04,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:04,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:04,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:04,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,645 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-11 11:11:04,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:04,666 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-11 11:11:04,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:04,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:04,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:04,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:04,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:04,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:04,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:04,720 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-11 11:11:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:05,045 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-11 11:11:05,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:05,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:11:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:05,047 INFO L225 Difference]: With dead ends: 37 [2019-01-11 11:11:05,047 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 11:11:05,048 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-11 11:11:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 11:11:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-11 11:11:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:11:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-11 11:11:05,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-11 11:11:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:05,054 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-11 11:11:05,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-11 11:11:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:05,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:05,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:05,056 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-11 11:11:05,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:05,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:05,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:05,178 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-11 11:11:05,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:05,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:05,179 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:05,179 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-11 11:11:05,182 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:05,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:05,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:05,188 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-11 11:11:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:05,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:05,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:05,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:05,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:05,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:05,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:05,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 11:11:05,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,225 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-11 11:11:05,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,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-11 11:11:05,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,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 22 treesize of output 45 [2019-01-11 11:11:05,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:05,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:05,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:05,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:05,303 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-11 11:11:05,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:05,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,499 INFO L303 Elim1Store]: Index analysis took 178 ms [2019-01-11 11:11:05,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:05,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:05,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:11:05,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:05,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:05,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:11:05,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:05,824 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-11 11:11:05,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:05,840 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-11 11:11:05,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:05,864 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-11 11:11:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:05,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:05,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:05,886 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-11 11:11:06,112 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-11 11:11:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:06,304 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-01-11 11:11:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:06,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:11:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:06,306 INFO L225 Difference]: With dead ends: 42 [2019-01-11 11:11:06,306 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 11:11:06,307 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-11 11:11:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 11:11:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-01-11 11:11:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 11:11:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-01-11 11:11:06,316 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-01-11 11:11:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:06,316 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-01-11 11:11:06,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-01-11 11:11:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:06,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:06,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:06,317 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-11 11:11:06,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:06,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:06,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:06,410 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-11 11:11:06,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:06,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:06,411 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:06,411 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-11 11:11:06,412 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:06,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:06,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:06,418 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-11 11:11:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:06,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:06,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:06,418 INFO 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-11 11:11:06,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:06,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:06,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:06,451 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-11 11:11:06,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,460 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-11 11:11:06,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,469 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-11 11:11:06,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,480 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-11 11:11:06,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:06,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:06,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:06,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:06,561 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-11 11:11:06,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:06,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,628 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-11 11:11:06,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:06,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-11 11:11:06,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:06,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:06,788 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-11 11:11:06,790 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-11 11:11:06,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:06,839 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-11 11:11:06,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:06,856 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-11 11:11:06,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:06,913 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-11 11:11:06,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:06,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:06,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:06,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:06,934 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-01-11 11:11:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:07,296 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-01-11 11:11:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:07,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:11:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:07,297 INFO L225 Difference]: With dead ends: 51 [2019-01-11 11:11:07,297 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:11:07,298 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-11 11:11:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:11:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-01-11 11:11:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 11:11:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-11 11:11:07,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-11 11:11:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:07,308 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-11 11:11:07,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-11 11:11:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:07,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:07,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:07,309 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-11 11:11:07,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:07,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:07,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:07,369 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-11 11:11:07,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:07,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:07,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:07,370 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-11 11:11:07,374 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:07,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:07,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:07,383 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-11 11:11:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:07,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:07,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:07,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:07,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:07,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:07,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:07,407 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-11 11:11:07,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 11:11:07,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,424 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-11 11:11:07,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,467 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-11 11:11:07,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:07,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:07,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:07,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:07,524 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-11 11:11:07,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:07,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:07,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:07,579 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-11 11:11:07,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:07,594 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-11 11:11:07,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:07,617 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-11 11:11:07,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:07,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:11:07,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:07,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:11:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:11:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:11:07,636 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-01-11 11:11:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:07,830 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-01-11 11:11:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:11:07,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:11:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:07,832 INFO L225 Difference]: With dead ends: 36 [2019-01-11 11:11:07,832 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 11:11:07,833 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-11 11:11:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 11:11:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-11 11:11:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:11:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-01-11 11:11:07,841 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-01-11 11:11:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:07,841 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-01-11 11:11:07,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:11:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-01-11 11:11:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:07,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:07,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:07,842 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-11 11:11:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:07,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:07,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:07,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:07,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:07,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:07,921 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-11 11:11:07,923 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:07,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:07,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:07,927 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-11 11:11:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:07,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:07,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:07,928 INFO 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-11 11:11:07,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:07,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:07,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:07,946 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-11 11:11:07,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,951 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-11 11:11:07,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,980 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-11 11:11:07,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:07,997 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-11 11:11:07,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,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-11 11:11:08,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:08,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:08,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,124 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-11 11:11:08,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:08,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,152 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-11 11:11:08,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,184 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-11 11:11:08,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:08,197 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-11 11:11:08,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:08,218 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-11 11:11:08,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:08,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:08,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:08,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:08,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:08,238 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-01-11 11:11:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:08,626 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-01-11 11:11:08,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:08,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:11:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:08,628 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:11:08,628 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 11:11:08,629 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-11 11:11:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 11:11:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-01-11 11:11:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 11:11:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-01-11 11:11:08,640 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-01-11 11:11:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:08,640 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-01-11 11:11:08,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-01-11 11:11:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:08,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:08,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:08,641 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-11 11:11:08,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:08,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:08,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:08,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:08,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:08,737 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-11 11:11:08,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:08,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:08,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:08,738 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-11 11:11:08,741 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:08,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:08,746 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:08,746 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-11 11:11:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:08,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:08,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:08,747 INFO 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-11 11:11:08,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:08,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:08,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:08,768 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-11 11:11:08,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,778 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-11 11:11:08,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 11:11:08,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,799 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-11 11:11:08,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,868 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-11 11:11:08,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:08,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,898 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-11 11:11:08,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:08,929 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-11 11:11:08,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:08,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:08,971 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-11 11:11:08,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:09,022 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-11 11:11:09,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:09,041 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-11 11:11:09,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:09,065 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-11 11:11:09,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:09,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:09,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:09,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:09,086 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-01-11 11:11:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:09,465 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-01-11 11:11:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:09,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:11:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:09,466 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:11:09,466 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 11:11:09,467 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-11 11:11:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 11:11:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-01-11 11:11:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:11:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-11 11:11:09,475 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-11 11:11:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:09,475 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-11 11:11:09,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-11 11:11:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:11:09,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:09,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:11:09,477 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-11 11:11:09,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:09,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:09,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:09,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:09,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:09,542 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-11 11:11:09,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:09,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:09,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:11:09,543 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-11 11:11:09,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:09,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:09,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:09,549 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-11 11:11:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:09,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:09,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:09,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:09,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:09,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:09,566 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-11 11:11:09,572 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-11 11:11:09,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:09,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 11:11:09,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:09,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:09,588 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-11 11:11:09,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:09,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:09,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:09,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:09,641 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-11 11:11:09,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:09,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:09,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:09,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:09,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:09,765 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-11 11:11:09,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:09,786 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-11 11:11:09,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:09,797 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-11 11:11:09,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:09,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:09,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:11:09,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:09,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:11:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:11:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:11:09,830 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-01-11 11:11:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:09,989 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-01-11 11:11:09,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:11:09,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:11:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:09,991 INFO L225 Difference]: With dead ends: 48 [2019-01-11 11:11:09,991 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:11:09,991 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-11 11:11:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:11:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-11 11:11:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:11:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-11 11:11:10,000 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-11 11:11:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:10,000 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-11 11:11:10,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:11:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-11 11:11:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:10,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:10,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:10,001 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-11 11:11:10,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:10,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:10,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:10,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:10,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:10,108 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-11 11:11:10,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:10,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:10,108 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:10,109 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-11 11:11:10,112 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:10,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:10,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:10,117 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-11 11:11:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:10,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:10,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:10,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:10,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:10,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:10,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:10,136 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-11 11:11:10,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,139 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-11 11:11:10,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,150 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-11 11:11:10,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,160 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-11 11:11:10,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,215 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-11 11:11:10,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:10,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,243 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-11 11:11:10,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,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-11 11:11:10,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:10,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:10,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,333 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-11 11:11:10,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:10,349 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-11 11:11:10,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:10,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:10,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:10,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:10,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:10,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:10,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:10,423 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-01-11 11:11:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:10,665 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-01-11 11:11:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:10,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:11:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:10,667 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:11:10,667 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:11:10,668 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-11 11:11:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:11:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-11 11:11:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:11:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-11 11:11:10,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-11 11:11:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:10,677 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-11 11:11:10,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-11 11:11:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:10,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:10,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:10,678 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-11 11:11:10,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:10,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:10,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:10,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:10,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:10,814 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-11 11:11:10,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:10,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:10,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:10,821 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-11 11:11:10,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:10,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:10,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:10,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:10,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:10,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:10,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:10,847 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-11 11:11:10,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,853 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-11 11:11:10,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,865 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-11 11:11:10,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,876 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-11 11:11:10,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,926 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-11 11:11:10,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:10,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:10,966 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-11 11:11:10,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:10,991 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-11 11:11:10,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,032 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-11 11:11:11,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:11,061 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-11 11:11:11,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:11,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,099 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:11,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:11,102 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-11 11:11:11,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:11,139 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-11 11:11:11,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:11,161 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-11 11:11:11,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:11,200 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-11 11:11:11,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:11,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:11,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:11,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:11,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:11,219 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-01-11 11:11:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:11,798 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-01-11 11:11:11,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:11:11,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:11:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:11,801 INFO L225 Difference]: With dead ends: 76 [2019-01-11 11:11:11,802 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:11:11,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:11:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-01-11 11:11:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:11:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-11 11:11:11,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-11 11:11:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:11,813 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-11 11:11:11,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-11 11:11:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:11,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:11,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:11,814 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-11 11:11:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:11,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:11,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:12,005 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-11 11:11:12,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:12,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:12,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:12,006 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-11 11:11:12,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:12,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:12,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:12,011 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-11 11:11:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:12,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:12,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:12,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:12,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:12,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:12,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:12,038 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-11 11:11:12,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,044 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-11 11:11:12,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,050 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-11 11:11:12,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,062 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-11 11:11:12,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:12,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,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-11 11:11:12,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,248 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-11 11:11:12,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:12,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,292 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:12,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:11:12,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,324 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-11 11:11:12,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:12,539 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-11 11:11:12,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:12,634 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-11 11:11:12,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:12,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-11 11:11:12,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:12,689 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-11 11:11:12,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:12,727 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-11 11:11:12,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:12,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:12,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:12,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:12,746 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-11 11:11:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:13,273 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-01-11 11:11:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:13,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:11:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:13,274 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:11:13,274 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:11:13,275 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-11 11:11:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:11:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-01-11 11:11:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:11:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-11 11:11:13,285 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-11 11:11:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:13,286 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-11 11:11:13,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-11 11:11:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:13,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:13,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:13,287 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-11 11:11:13,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:13,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:13,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:13,372 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-11 11:11:13,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:13,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:13,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:13,373 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-11 11:11:13,375 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:13,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:13,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:13,380 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-11 11:11:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:13,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:13,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:13,380 INFO 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-11 11:11:13,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:13,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:13,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:13,424 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-11 11:11:13,458 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-11 11:11:13,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,463 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-11 11:11:13,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:11:13,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:13,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:13,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:13,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:13,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:11:13,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:13,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,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, 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-11 11:11:13,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:13,558 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-11 11:11:13,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:13,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:13,581 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-11 11:11:13,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:13,601 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-11 11:11:13,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:11:13,615 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-11 11:11:13,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:13,638 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-11 11:11:13,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:13,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:13,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:13,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:13,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:13,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:13,659 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-01-11 11:11:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:13,881 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-01-11 11:11:13,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:13,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:11:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:13,882 INFO L225 Difference]: With dead ends: 58 [2019-01-11 11:11:13,883 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:11:13,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:11:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:11:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-11 11:11:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:11:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-11 11:11:13,896 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-11 11:11:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:13,896 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-11 11:11:13,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-11 11:11:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:13,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:13,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:13,897 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-01-11 11:11:13,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:13,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:13,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:13,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:13,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:14,036 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-11 11:11:14,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:14,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:14,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:14,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:14,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:14,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:14,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:14,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:14,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:11:14,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:14,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:14,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-11 11:11:14,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,070 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-11 11:11:14,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,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-11 11:11:14,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,089 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-11 11:11:14,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:14,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:14,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:14,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:14,144 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-11 11:11:14,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:14,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,169 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-11 11:11:14,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:14,211 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-11 11:11:14,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:14,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,258 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-11 11:11:14,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:14,308 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-11 11:11:14,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:14,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,337 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:14,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:14,339 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-11 11:11:14,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:14,391 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-11 11:11:14,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:14,409 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-11 11:11:14,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:14,454 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-11 11:11:14,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:14,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:14,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:14,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:14,475 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-11 11:11:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:14,858 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-01-11 11:11:14,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:11:14,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:11:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:14,860 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:11:14,860 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 11:11:14,860 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-11 11:11:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 11:11:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-01-11 11:11:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:11:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-11 11:11:14,870 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-01-11 11:11:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:14,870 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-11 11:11:14,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-11 11:11:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:14,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:14,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:14,871 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-11 11:11:14,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:14,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:14,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:14,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:14,936 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-11 11:11:14,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:11:14,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:11:14,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:11:14,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:11:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:11:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:11:14,937 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-01-11 11:11:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:15,234 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-01-11 11:11:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:11:15,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:11:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:15,235 INFO L225 Difference]: With dead ends: 36 [2019-01-11 11:11:15,235 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 11:11:15,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:11:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 11:11:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-11 11:11:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:11:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-01-11 11:11:15,245 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-01-11 11:11:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:15,245 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-01-11 11:11:15,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:11:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-01-11 11:11:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:15,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:15,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:15,246 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-11 11:11:15,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:15,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:15,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:15,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:15,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:15,320 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:15,320 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-11 11:11:15,321 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:15,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:15,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:15,325 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-11 11:11:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:15,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:15,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:15,325 INFO 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-11 11:11:15,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:15,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:15,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:15,342 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-11 11:11:15,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,346 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-11 11:11:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,351 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-11 11:11:15,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,360 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-11 11:11:15,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,422 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-11 11:11:15,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:15,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,446 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-11 11:11:15,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,474 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-11 11:11:15,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:15,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:15,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:15,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,926 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-11 11:11:15,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:15,982 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-11 11:11:15,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:15,992 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-11 11:11:16,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:16,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:11:16,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:16,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:16,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:11:16,012 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-01-11 11:11:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:16,213 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-01-11 11:11:16,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:16,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:11:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:16,214 INFO L225 Difference]: With dead ends: 44 [2019-01-11 11:11:16,215 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 11:11:16,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 11:11:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-11 11:11:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:11:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-01-11 11:11:16,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-01-11 11:11:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:16,226 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-01-11 11:11:16,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-01-11 11:11:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:16,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:16,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:16,227 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-11 11:11:16,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:16,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:16,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:16,335 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-11 11:11:16,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:16,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:16,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:16,336 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-11 11:11:16,337 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:16,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:16,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:16,340 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-11 11:11:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:16,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:16,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:16,341 INFO 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-11 11:11:16,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:16,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:16,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:16,371 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-11 11:11:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,373 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-11 11:11:16,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,380 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-11 11:11:16,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,402 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-11 11:11:16,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:16,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:16,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:16,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:16,455 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-11 11:11:16,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:16,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,487 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-11 11:11:16,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:16,515 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-11 11:11:16,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:16,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:16,562 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:16,563 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-11 11:11:16,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:16,594 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-11 11:11:16,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:16,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:16,633 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-11 11:11:16,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:16,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:16,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:16,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:16,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:16,655 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-01-11 11:11:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:16,960 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-01-11 11:11:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:16,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:11:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:16,961 INFO L225 Difference]: With dead ends: 49 [2019-01-11 11:11:16,961 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:11:16,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-11 11:11:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:11:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-01-11 11:11:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 11:11:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-01-11 11:11:16,974 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-01-11 11:11:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:16,974 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-01-11 11:11:16,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-01-11 11:11:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:16,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:16,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:16,976 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-11 11:11:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:16,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:16,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:17,361 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-11 11:11:17,533 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-11 11:11:17,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:17,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:17,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:17,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:17,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:17,535 INFO 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-11 11:11:17,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:17,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:17,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:11:17,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:17,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:17,606 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-11 11:11:17,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:17,647 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-11 11:11:17,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:17,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:17,711 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-11 11:11:17,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:17,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:17,796 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-11 11:11:17,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:18,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:18,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:18,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:18,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:11:18,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:18,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:18,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:18,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:18,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:18,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:18,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:18,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:18,389 INFO L303 Elim1Store]: Index analysis took 183 ms [2019-01-11 11:11:18,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, 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-11 11:11:18,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:18,749 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-11 11:11:18,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:18,963 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 11:11:19,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:19,179 INFO L303 Elim1Store]: Index analysis took 212 ms [2019-01-11 11:11:19,180 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-11 11:11:19,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:19,431 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-11 11:11:19,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:19,455 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-11 11:11:19,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:19,474 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-11 11:11:19,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:19,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:19,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:19,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:19,495 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-01-11 11:11:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:20,031 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-01-11 11:11:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:20,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:11:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:20,034 INFO L225 Difference]: With dead ends: 58 [2019-01-11 11:11:20,034 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:11:20,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:11:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:11:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-01-11 11:11:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:11:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-01-11 11:11:20,049 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-01-11 11:11:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:20,049 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-01-11 11:11:20,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-01-11 11:11:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:20,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:20,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:20,051 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:20,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:20,051 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-01-11 11:11:20,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:20,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:20,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:20,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:20,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:20,180 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-11 11:11:20,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:20,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:20,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:20,180 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-01-11 11:11:20,181 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:20,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:20,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:20,186 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-11 11:11:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:20,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:20,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:20,187 INFO 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-11 11:11:20,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:20,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:20,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:20,206 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-11 11:11:20,210 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-11 11:11:20,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,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, 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-11 11:11:20,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,246 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-11 11:11:20,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:20,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:20,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:20,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:20,288 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-11 11:11:20,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:20,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,330 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-11 11:11:20,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:20,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-11 11:11:20,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:20,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:20,519 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-11 11:11:20,519 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-11 11:11:20,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:20,808 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-11 11:11:20,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:11:20,973 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-11 11:11:20,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:21,350 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-11 11:11:21,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:21,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:21,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:21,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:21,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:21,413 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-01-11 11:11:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:21,909 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-01-11 11:11:21,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:21,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:11:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:21,910 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:11:21,911 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:11:21,911 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-11 11:11:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:11:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-01-11 11:11:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:11:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-01-11 11:11:21,923 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-01-11 11:11:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:21,924 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-01-11 11:11:21,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-01-11 11:11:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:21,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:21,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:21,925 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-01-11 11:11:21,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:21,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:21,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:22,044 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-11 11:11:22,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:22,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:22,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:22,045 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-01-11 11:11:22,046 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:22,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:22,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:22,050 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-11 11:11:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:22,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:22,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:22,051 INFO 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-11 11:11:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:22,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:22,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:22,102 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-11 11:11:22,138 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-11 11:11:22,155 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-11 11:11:22,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,164 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-11 11:11:22,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,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-11 11:11:22,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-01-11 11:11:22,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:11:22,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,227 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-11 11:11:22,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 11:11:22,238 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-11 11:11:22,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:22,242 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-11 11:11:22,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:11:22,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:11:22,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:11:22,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:11:22,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:11:22,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:11:22,261 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-01-11 11:11:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:22,521 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-01-11 11:11:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:11:22,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:11:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:22,523 INFO L225 Difference]: With dead ends: 74 [2019-01-11 11:11:22,523 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 11:11:22,523 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-11 11:11:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 11:11:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-01-11 11:11:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:11:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-01-11 11:11:22,544 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-01-11 11:11:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:22,544 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-01-11 11:11:22,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:11:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-01-11 11:11:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:11:22,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:22,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:11:22,545 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-01-11 11:11:22,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:22,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:22,666 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-11 11:11:22,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:22,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:22,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:11:22,666 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-11 11:11:22,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:22,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:22,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:22,671 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-11 11:11:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:22,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:22,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:22,671 INFO 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-11 11:11:22,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:22,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:22,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:22,694 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-11 11:11:22,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,696 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-11 11:11:22,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,702 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-11 11:11:22,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,709 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-11 11:11:22,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,761 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-11 11:11:22,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:22,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,789 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-11 11:11:22,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,818 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-11 11:11:22,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:22,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,847 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:22,848 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-11 11:11:22,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,882 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-11 11:11:22,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:22,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:22,914 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-11 11:11:22,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,947 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-11 11:11:22,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:22,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:23,017 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-11 11:11:23,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:23,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:11:23,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:23,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:23,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:11:23,038 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-01-11 11:11:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:23,491 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-01-11 11:11:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:23,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:11:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:23,493 INFO L225 Difference]: With dead ends: 105 [2019-01-11 11:11:23,493 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 11:11:23,494 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-11 11:11:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 11:11:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-01-11 11:11:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:11:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-01-11 11:11:23,512 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-01-11 11:11:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:23,512 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-01-11 11:11:23,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-01-11 11:11:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:23,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:23,513 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:11:23,513 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-01-11 11:11:23,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:23,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:23,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:23,569 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-11 11:11:23,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:23,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:23,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:23,569 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-11 11:11:23,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:23,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:23,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:23,573 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-11 11:11:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:23,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:23,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:23,574 INFO 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-11 11:11:23,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:23,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:23,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:23,594 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-11 11:11:23,630 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-11 11:11:23,717 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-11 11:11:23,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:23,864 INFO L303 Elim1Store]: Index analysis took 146 ms [2019-01-11 11:11:23,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, 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-11 11:11:23,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:23,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:23,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:23,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:23,913 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-11 11:11:23,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-11 11:11:23,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,014 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-11 11:11:24,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 11:11:24,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,287 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-11 11:11:24,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,297 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-11 11:11:24,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-11 11:11:24,309 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-11 11:11:24,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:24,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-11 11:11:24,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:24,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:11:24,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:24,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:11:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:11:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:11:24,378 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-01-11 11:11:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:24,529 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-01-11 11:11:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:24,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-11 11:11:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:24,530 INFO L225 Difference]: With dead ends: 85 [2019-01-11 11:11:24,531 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 11:11:24,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 11:11:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-11 11:11:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:11:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-11 11:11:24,551 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-11 11:11:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:24,552 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-11 11:11:24,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:11:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-11 11:11:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:24,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:24,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:24,553 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-11 11:11:24,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:24,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:24,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:24,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:24,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:24,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:24,666 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-11 11:11:24,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:24,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:24,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:24,670 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-11 11:11:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:24,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:24,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:24,671 INFO 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-11 11:11:24,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:24,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:24,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:24,705 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-11 11:11:24,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,709 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-11 11:11:24,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 11:11:24,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,727 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-11 11:11:24,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,828 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-11 11:11:24,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:24,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,901 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-11 11:11:24,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,925 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-11 11:11:24,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:24,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:24,962 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-11 11:11:24,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,992 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-11 11:11:24,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:25,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:25,031 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-11 11:11:25,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:25,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:25,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:25,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:25,050 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-01-11 11:11:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:25,275 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-01-11 11:11:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:25,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:11:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:25,277 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:11:25,277 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:11:25,277 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-11 11:11:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:11:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-01-11 11:11:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:11:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-11 11:11:25,295 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-11 11:11:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:25,296 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-11 11:11:25,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-11 11:11:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:25,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:25,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:25,296 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-11 11:11:25,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:25,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:25,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:25,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:25,556 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 11:11:25,605 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-11 11:11:25,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:25,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:25,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:25,606 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-11 11:11:25,606 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:25,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:25,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:25,610 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-11 11:11:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:25,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:25,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:25,611 INFO 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-11 11:11:25,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:25,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:25,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:25,635 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-11 11:11:25,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,638 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-11 11:11:25,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,643 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-11 11:11:25,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,648 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-11 11:11:25,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:25,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:25,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:25,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:25,697 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-11 11:11:25,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:25,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:25,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:25,748 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-11 11:11:25,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:25,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,798 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-11 11:11:25,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:25,830 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-11 11:11:25,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:25,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:25,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:25,860 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-11 11:11:25,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:25,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:11:25,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:25,912 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-11 11:11:25,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:25,976 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-11 11:11:25,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:25,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:11:25,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:25,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:25,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:11:25,996 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-11 11:11:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:26,389 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-01-11 11:11:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:26,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:11:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:26,391 INFO L225 Difference]: With dead ends: 97 [2019-01-11 11:11:26,391 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 11:11:26,391 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-11 11:11:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 11:11:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-01-11 11:11:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:11:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-11 11:11:26,411 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-11 11:11:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:26,411 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-11 11:11:26,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-11 11:11:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:26,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:26,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:26,412 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:26,412 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-11 11:11:26,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:26,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:26,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:26,565 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-11 11:11:26,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:26,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:26,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:26,566 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-11 11:11:26,567 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:26,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:26,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:26,570 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-11 11:11:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:26,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:26,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:26,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:26,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:26,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:26,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:26,602 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-11 11:11:26,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,612 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-11 11:11:26,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,618 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-11 11:11:26,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,628 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-11 11:11:26,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:26,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,710 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-11 11:11:26,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,737 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-11 11:11:26,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:26,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,772 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-11 11:11:26,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,802 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-11 11:11:26,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:26,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:26,833 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:26,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, 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-11 11:11:26,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:26,868 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-11 11:11:26,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:26,889 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-11 11:11:26,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:26,934 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-11 11:11:26,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:26,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:26,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:26,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:26,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:26,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:26,953 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-11 11:11:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:27,334 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-01-11 11:11:27,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:27,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:11:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:27,336 INFO L225 Difference]: With dead ends: 102 [2019-01-11 11:11:27,336 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 11:11:27,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:11:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 11:11:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-01-11 11:11:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:11:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-01-11 11:11:27,360 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-01-11 11:11:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:27,360 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-01-11 11:11:27,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-01-11 11:11:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:27,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:27,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:27,361 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-01-11 11:11:27,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:27,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:27,610 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 11:11:27,653 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-11 11:11:27,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:27,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:27,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:27,654 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-01-11 11:11:27,657 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:27,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:27,660 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:27,660 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-11 11:11:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:27,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:27,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:27,661 INFO 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-11 11:11:27,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:27,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:27,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:27,679 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-11 11:11:27,682 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-11 11:11:27,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,688 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-11 11:11:27,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,696 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-11 11:11:27,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:27,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:27,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:27,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:27,734 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-11 11:11:27,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:27,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,767 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-11 11:11:27,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:27,780 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-11 11:11:27,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:27,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,804 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:27,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:11:27,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:27,824 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-11 11:11:27,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-01-11 11:11:27,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:27,850 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-11 11:11:27,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:27,867 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-11 11:11:27,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-11 11:11:27,885 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-11 11:11:27,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:27,919 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-11 11:11:27,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:27,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:27,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:27,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:27,939 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-01-11 11:11:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:28,362 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-01-11 11:11:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:11:28,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:11:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:28,364 INFO L225 Difference]: With dead ends: 108 [2019-01-11 11:11:28,364 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:11:28,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:11:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-01-11 11:11:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:11:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-01-11 11:11:28,388 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-01-11 11:11:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:28,389 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-01-11 11:11:28,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-01-11 11:11:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:28,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:28,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:28,390 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:28,390 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-01-11 11:11:28,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:28,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:28,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:28,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:28,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:28,532 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-11 11:11:28,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:28,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:28,532 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:28,533 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-11 11:11:28,534 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:28,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:28,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:28,536 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-11 11:11:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:28,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:28,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:28,537 INFO 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-11 11:11:28,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:28,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:28,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:28,569 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-11 11:11:28,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,573 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-11 11:11:28,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,585 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-11 11:11:28,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,598 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-11 11:11:28,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:28,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,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, 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-11 11:11:28,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,728 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-11 11:11:28,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:28,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,760 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:28,761 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-11 11:11:28,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,795 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-11 11:11:28,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:28,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:28,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:28,876 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-11 11:11:28,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:28,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:28,970 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:28,971 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-11 11:11:28,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:29,009 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-11 11:11:29,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:29,024 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-11 11:11:29,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:29,122 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-11 11:11:29,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:29,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:11:29,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:29,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:11:29,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:11:29,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:29,142 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-01-11 11:11:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:30,569 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-01-11 11:11:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:30,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:11:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:30,571 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:11:30,571 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:11:30,572 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-11 11:11:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:11:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-01-11 11:11:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-11 11:11:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-01-11 11:11:30,594 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-01-11 11:11:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:30,594 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-01-11 11:11:30,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:11:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-01-11 11:11:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:30,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:30,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:30,595 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:30,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-01-11 11:11:30,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:30,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:31,258 WARN L181 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-11 11:11:31,336 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-11 11:11:31,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:31,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:31,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:31,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:31,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:31,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:31,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:31,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:31,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:11:31,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:31,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:31,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 11:11:31,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:11:31,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,366 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-11 11:11:31,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,372 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-11 11:11:31,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:31,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,449 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-11 11:11:31,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,477 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-11 11:11:31,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:31,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,511 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-11 11:11:31,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,540 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-11 11:11:31,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:31,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,598 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:31,599 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-11 11:11:31,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,633 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-11 11:11:31,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,661 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:31,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:31,663 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-11 11:11:31,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,695 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-11 11:11:31,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:31,712 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-11 11:11:31,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:31,775 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-11 11:11:31,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:11:31,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:31,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:11:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:11:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:11:31,795 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-01-11 11:11:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:32,445 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-01-11 11:11:32,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:32,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:11:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:32,448 INFO L225 Difference]: With dead ends: 146 [2019-01-11 11:11:32,448 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 11:11:32,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:11:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 11:11:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-01-11 11:11:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 11:11:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-01-11 11:11:32,474 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-01-11 11:11:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:32,474 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-01-11 11:11:32,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:11:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-01-11 11:11:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:32,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:32,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:32,477 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-11 11:11:32,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:32,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:32,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:32,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:32,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:32,567 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-11 11:11:32,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:32,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:32,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:32,568 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-11 11:11:32,569 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:32,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:32,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:32,571 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-11 11:11:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:32,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:32,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:32,572 INFO 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-11 11:11:32,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:32,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:32,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:32,588 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-11 11:11:32,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,591 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-11 11:11:32,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,599 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-11 11:11:32,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,613 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-11 11:11:32,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:32,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:32,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:32,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:32,662 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-11 11:11:32,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:32,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,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 51 [2019-01-11 11:11:32,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:32,718 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-11 11:11:32,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:32,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:32,748 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-11 11:11:32,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:32,781 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-11 11:11:32,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:32,798 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-11 11:11:32,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:32,816 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-11 11:11:32,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:32,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:11:32,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:32,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:11:32,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:11:32,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:11:32,835 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-01-11 11:11:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:33,087 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-01-11 11:11:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:33,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-11 11:11:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:33,089 INFO L225 Difference]: With dead ends: 111 [2019-01-11 11:11:33,089 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 11:11:33,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:11:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 11:11:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-01-11 11:11:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 11:11:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-01-11 11:11:33,118 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-01-11 11:11:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:33,119 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-01-11 11:11:33,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:11:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-01-11 11:11:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:33,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:33,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:33,120 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-11 11:11:33,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:33,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:33,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:33,385 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 11:11:33,426 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-11 11:11:33,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:33,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:33,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:33,427 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-11 11:11:33,428 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:33,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:33,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:33,431 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-11 11:11:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:33,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:33,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:33,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:33,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:33,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:33,462 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-11 11:11:33,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,492 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-11 11:11:33,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,495 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-11 11:11:33,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,502 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-11 11:11:33,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:33,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:33,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:33,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:33,551 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-11 11:11:33,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:33,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:33,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:33,629 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-11 11:11:33,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:33,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,659 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:33,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:33,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:33,689 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-11 11:11:33,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:33,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:11:33,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:33,799 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-11 11:11:33,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:33,818 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-11 11:11:33,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:33,844 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-11 11:11:33,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:33,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:11:33,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:33,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:33,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:11:33,864 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-01-11 11:11:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:34,270 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-01-11 11:11:34,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:34,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:11:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:34,273 INFO L225 Difference]: With dead ends: 153 [2019-01-11 11:11:34,273 INFO L226 Difference]: Without dead ends: 152 [2019-01-11 11:11:34,274 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-11 11:11:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-11 11:11:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-01-11 11:11:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 11:11:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-01-11 11:11:34,306 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-01-11 11:11:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:34,306 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-01-11 11:11:34,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-01-11 11:11:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:34,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:34,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:34,307 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-11 11:11:34,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:34,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:34,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:34,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:34,493 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-11 11:11:34,516 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-11 11:11:34,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:34,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:34,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:34,517 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-11 11:11:34,519 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:34,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:34,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:34,521 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-11 11:11:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:34,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:34,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:34,522 INFO 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-11 11:11:34,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:34,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:34,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:34,541 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-11 11:11:34,550 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-11 11:11:34,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,555 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-11 11:11:34,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,563 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-11 11:11:34,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:34,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:34,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:34,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:34,617 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-11 11:11:34,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:34,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,649 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-11 11:11:34,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:34,665 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-11 11:11:34,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:34,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:34,686 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:34,687 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-11 11:11:34,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:34,705 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-11 11:11:34,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:11:34,723 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-11 11:11:34,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:34,755 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-11 11:11:34,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:34,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:34,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:34,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:34,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:34,775 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-01-11 11:11:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:35,006 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-01-11 11:11:35,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:35,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:11:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:35,008 INFO L225 Difference]: With dead ends: 143 [2019-01-11 11:11:35,008 INFO L226 Difference]: Without dead ends: 138 [2019-01-11 11:11:35,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-11 11:11:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-11 11:11:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-01-11 11:11:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 11:11:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-01-11 11:11:35,045 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-01-11 11:11:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:35,045 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-01-11 11:11:35,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-01-11 11:11:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:35,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:35,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:35,046 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:35,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-11 11:11:35,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:35,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:35,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:35,346 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2019-01-11 11:11:35,405 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-11 11:11:35,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:35,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:35,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:35,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:35,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:35,406 INFO 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-11 11:11:35,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:35,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:35,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:11:35,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:35,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:35,425 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-11 11:11:35,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,428 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-11 11:11:35,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,433 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-11 11:11:35,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,439 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-11 11:11:35,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:35,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:35,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:35,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:35,487 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-11 11:11:35,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:35,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,513 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-11 11:11:35,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:35,541 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-11 11:11:35,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:35,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:11:35,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:35,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-11 11:11:35,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:35,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:35,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:35,647 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-11 11:11:35,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:35,684 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-11 11:11:35,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:35,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:35,778 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-11 11:11:35,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:35,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:11:35,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:35,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:11:35,797 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-01-11 11:11:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:36,210 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-01-11 11:11:36,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:11:36,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:11:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:36,213 INFO L225 Difference]: With dead ends: 196 [2019-01-11 11:11:36,213 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 11:11:36,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:11:36,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 11:11:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-01-11 11:11:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-11 11:11:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-01-11 11:11:36,255 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-01-11 11:11:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:36,255 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-01-11 11:11:36,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-01-11 11:11:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:36,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:36,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:36,256 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-01-11 11:11:36,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:36,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:36,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:36,423 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-11 11:11:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:36,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:36,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:36,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:36,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:36,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:36,498 INFO 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-11 11:11:36,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:11:36,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:11:36,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:11:36,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:36,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:36,514 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-11 11:11:36,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,527 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-11 11:11:36,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,531 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-11 11:11:36,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,537 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-11 11:11:36,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:36,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,611 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-11 11:11:36,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,640 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-11 11:11:36,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:36,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,671 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-11 11:11:36,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,701 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-11 11:11:36,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:36,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,730 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:36,731 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-11 11:11:36,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,761 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-11 11:11:36,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:36,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:36,791 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:36,791 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-11 11:11:36,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:36,827 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-11 11:11:36,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:36,844 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-11 11:11:36,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:36,909 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-11 11:11:36,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:36,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:11:36,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:36,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:11:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:11:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:36,927 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-01-11 11:11:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:37,492 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-01-11 11:11:37,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:11:37,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:11:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:37,495 INFO L225 Difference]: With dead ends: 205 [2019-01-11 11:11:37,496 INFO L226 Difference]: Without dead ends: 197 [2019-01-11 11:11:37,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:11:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-11 11:11:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-01-11 11:11:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 11:11:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-11 11:11:37,536 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-11 11:11:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:37,537 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-11 11:11:37,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:11:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-11 11:11:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:37,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:37,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:37,538 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-11 11:11:37,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:37,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:37,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:37,618 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-11 11:11:37,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:37,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:37,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:37,618 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-11 11:11:37,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:37,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:37,622 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:37,622 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-11 11:11:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:37,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:37,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:37,623 INFO 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-11 11:11:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:37,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:37,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:37,645 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-11 11:11:37,650 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-11 11:11:37,665 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-11 11:11:37,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:37,681 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-11 11:11:37,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:37,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:37,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:37,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:37,722 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-11 11:11:37,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-11 11:11:37,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:37,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:37,742 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-11 11:11:37,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:37,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:37,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 11:11:37,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:37,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:37,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:37,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:37,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 11:11:37,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:37,773 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-11 11:11:37,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 11:11:37,787 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-11 11:11:37,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:37,807 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-11 11:11:37,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:37,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:37,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:37,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:37,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:37,825 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-11 11:11:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:38,002 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-01-11 11:11:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:38,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:11:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:38,008 INFO L225 Difference]: With dead ends: 165 [2019-01-11 11:11:38,008 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 11:11:38,009 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-11 11:11:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 11:11:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-01-11 11:11:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 11:11:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-11 11:11:38,047 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-11 11:11:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:38,048 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-11 11:11:38,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-11 11:11:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:11:38,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:38,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:11:38,048 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-01-11 11:11:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:38,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:38,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:38,292 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-11 11:11:38,555 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-11 11:11:38,564 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-11 11:11:38,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:38,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:38,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:11:38,565 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-01-11 11:11:38,566 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:38,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:38,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:38,568 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-11 11:11:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:38,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:38,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:38,569 INFO 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-11 11:11:38,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:38,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:38,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:38,585 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-11 11:11:38,589 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-11 11:11:38,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,600 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-11 11:11:38,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,615 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-11 11:11:38,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:38,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:38,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:38,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:38,655 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-11 11:11:38,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:38,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,684 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-11 11:11:38,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:38,700 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-11 11:11:38,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:38,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:38,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:11:38,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:38,748 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-11 11:11:38,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:38,764 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-11 11:11:38,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:38,781 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-11 11:11:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:38,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:38,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:38,800 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-11 11:11:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:39,036 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-01-11 11:11:39,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:39,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:11:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:39,039 INFO L225 Difference]: With dead ends: 174 [2019-01-11 11:11:39,039 INFO L226 Difference]: Without dead ends: 173 [2019-01-11 11:11:39,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:11:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-11 11:11:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-01-11 11:11:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-11 11:11:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-01-11 11:11:39,077 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-01-11 11:11:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:39,077 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-01-11 11:11:39,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-01-11 11:11:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:39,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:39,078 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:11:39,078 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-01-11 11:11:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:39,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:39,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:39,234 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-11 11:11:39,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:39,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:39,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:39,235 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-01-11 11:11:39,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:39,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:39,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:39,239 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-11 11:11:39,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:39,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:39,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:39,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:39,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:39,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:39,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:39,258 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-11 11:11:39,260 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-11 11:11:39,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 11:11:39,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:11:39,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,320 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-11 11:11:39,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-01-11 11:11:39,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:39,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:11:39,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 11:11:39,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:39,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:11:39,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:39,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-11 11:11:39,403 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-11 11:11:39,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:39,417 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-11 11:11:39,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:11:39,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-01-11 11:11:39,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:11:39,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:11:39,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:11:39,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:11:39,436 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-01-11 11:11:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:39,583 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-01-11 11:11:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:11:39,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 11:11:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:39,587 INFO L225 Difference]: With dead ends: 357 [2019-01-11 11:11:39,587 INFO L226 Difference]: Without dead ends: 353 [2019-01-11 11:11:39,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:11:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-11 11:11:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-01-11 11:11:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 11:11:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-01-11 11:11:39,724 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-01-11 11:11:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:39,725 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-01-11 11:11:39,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:11:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-01-11 11:11:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:39,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:39,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:39,726 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-01-11 11:11:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:39,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:39,960 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-11 11:11:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:39,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:39,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:39,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:39,987 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-11 11:11:39,992 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:39,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:39,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:39,994 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-11 11:11:39,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:39,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:39,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:39,995 INFO 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-11 11:11:40,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:40,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:40,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:40,027 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-11 11:11:40,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,061 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-11 11:11:40,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,090 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-11 11:11:40,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,164 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-11 11:11:40,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,306 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-11 11:11:40,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:40,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,329 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-11 11:11:40,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,355 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-11 11:11:40,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:40,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:40,380 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-11 11:11:40,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,410 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-11 11:11:40,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:40,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:40,446 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-11 11:11:40,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:40,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:11:40,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:40,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:40,465 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-01-11 11:11:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:40,745 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-01-11 11:11:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:40,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:11:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:40,749 INFO L225 Difference]: With dead ends: 348 [2019-01-11 11:11:40,749 INFO L226 Difference]: Without dead ends: 338 [2019-01-11 11:11:40,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:11:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-11 11:11:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-01-11 11:11:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-11 11:11:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-01-11 11:11:40,844 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-01-11 11:11:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:40,844 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-01-11 11:11:40,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-01-11 11:11:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:40,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:40,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:40,845 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:40,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-11 11:11:40,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:40,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:41,011 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-11 11:11:41,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:41,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:41,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:41,012 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-11 11:11:41,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:41,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:41,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:41,015 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-11 11:11:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:41,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:41,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:41,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:41,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:41,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:41,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:41,038 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-11 11:11:41,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,042 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-11 11:11:41,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,048 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-11 11:11:41,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,056 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-11 11:11:41,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,114 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:41,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,213 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-11 11:11:41,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,237 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-11 11:11:41,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:41,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,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 59 [2019-01-11 11:11:41,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,296 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-11 11:11:41,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:41,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,326 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:41,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:41,328 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-11 11:11:41,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:41,361 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-11 11:11:41,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:41,385 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-11 11:11:41,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:41,444 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-11 11:11:41,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:41,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:41,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:41,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:41,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:41,464 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-01-11 11:11:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:41,868 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-01-11 11:11:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:41,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:11:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:41,871 INFO L225 Difference]: With dead ends: 348 [2019-01-11 11:11:41,871 INFO L226 Difference]: Without dead ends: 343 [2019-01-11 11:11:41,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:11:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-11 11:11:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-01-11 11:11:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 11:11:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-01-11 11:11:41,976 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-01-11 11:11:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:41,976 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-01-11 11:11:41,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-01-11 11:11:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:41,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:41,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:41,977 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-11 11:11:41,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:41,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:41,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:41,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:41,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:42,159 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 11:11:42,273 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-11 11:11:42,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:42,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:42,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:42,273 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-11 11:11:42,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:42,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:42,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:42,276 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-11 11:11:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:42,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:42,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:42,277 INFO 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-11 11:11:42,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:42,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:42,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:42,294 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-11 11:11:42,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,298 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-11 11:11:42,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,305 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-11 11:11:42,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,313 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-11 11:11:42,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:42,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,527 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-11 11:11:42,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:42,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,559 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-11 11:11:42,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,604 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-11 11:11:42,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:42,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,635 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:42,636 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-11 11:11:42,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,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-11 11:11:42,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:42,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,699 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:42,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:42,701 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-11 11:11:42,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:42,733 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-11 11:11:42,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:42,754 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-11 11:11:42,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:42,798 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-11 11:11:42,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:42,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:11:42,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:42,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:11:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:11:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:42,818 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-01-11 11:11:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:43,387 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-01-11 11:11:43,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:11:43,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:11:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:43,391 INFO L225 Difference]: With dead ends: 457 [2019-01-11 11:11:43,392 INFO L226 Difference]: Without dead ends: 456 [2019-01-11 11:11:43,392 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-11 11:11:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-01-11 11:11:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-01-11 11:11:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 11:11:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-01-11 11:11:43,537 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-01-11 11:11:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:43,537 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-01-11 11:11:43,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:11:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-01-11 11:11:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:43,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:43,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:43,539 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-11 11:11:43,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:43,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:43,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:43,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:43,735 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-11 11:11:43,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:43,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:43,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:43,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:43,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:43,736 INFO 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-11 11:11:43,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:43,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:43,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:11:43,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:43,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:43,761 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-11 11:11:43,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,764 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-11 11:11:43,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,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-11 11:11:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,781 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-11 11:11:43,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:43,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:43,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,896 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-11 11:11:43,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:43,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:43,929 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-11 11:11:43,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,958 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-11 11:11:43,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:43,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:43,990 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-11 11:11:43,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:44,020 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-11 11:11:44,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:44,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:44,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 35 treesize of output 75 [2019-01-11 11:11:44,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:44,085 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-11 11:11:44,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:44,104 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-11 11:11:44,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:44,156 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-11 11:11:44,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:44,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:11:44,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:44,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:11:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:11:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:44,175 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-01-11 11:11:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:44,680 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-01-11 11:11:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:44,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:11:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:44,684 INFO L225 Difference]: With dead ends: 346 [2019-01-11 11:11:44,685 INFO L226 Difference]: Without dead ends: 345 [2019-01-11 11:11:44,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:11:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-11 11:11:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-01-11 11:11:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-11 11:11:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-01-11 11:11:44,757 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-01-11 11:11:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:44,757 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-01-11 11:11:44,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:11:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-01-11 11:11:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:44,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:44,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:44,758 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:44,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-01-11 11:11:44,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:44,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:44,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:44,897 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-11 11:11:44,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:44,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:44,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:44,898 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-11 11:11:44,898 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:44,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:44,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:44,902 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-11 11:11:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:44,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:44,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:44,902 INFO 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-11 11:11:44,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:44,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:44,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:44,922 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-11 11:11:44,927 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-11 11:11:44,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,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, 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-11 11:11:44,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:44,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:11:44,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:44,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:44,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:44,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:44,990 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-11 11:11:44,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:45,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,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, 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-11 11:11:45,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,035 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-11 11:11:45,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:45,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,053 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:45,054 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-11 11:11:45,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,070 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-11 11:11:45,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-01-11 11:11:45,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,094 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-11 11:11:45,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,110 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-11 11:11:45,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-11 11:11:45,127 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-11 11:11:45,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:45,154 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-11 11:11:45,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:45,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:11:45,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:45,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:11:45,173 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-01-11 11:11:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:45,548 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-01-11 11:11:45,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:45,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:11:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:45,552 INFO L225 Difference]: With dead ends: 280 [2019-01-11 11:11:45,552 INFO L226 Difference]: Without dead ends: 277 [2019-01-11 11:11:45,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-11 11:11:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-01-11 11:11:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-11 11:11:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-01-11 11:11:45,656 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-01-11 11:11:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:45,656 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-01-11 11:11:45,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-01-11 11:11:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:45,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:45,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:45,658 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:45,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-01-11 11:11:45,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:45,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:45,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:45,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:45,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:45,756 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-11 11:11:45,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:45,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:45,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:45,757 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-01-11 11:11:45,758 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:45,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:45,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:45,760 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-11 11:11:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:45,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:45,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:45,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:45,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:45,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:45,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:45,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 11:11:45,791 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-11 11:11:45,801 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-11 11:11:45,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,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, 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-11 11:11:45,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,842 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-11 11:11:45,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-11 11:11:45,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,862 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-11 11:11:45,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 11:11:45,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:45,886 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-11 11:11:45,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:45,896 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-11 11:11:45,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-11 11:11:45,908 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-11 11:11:45,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:45,922 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-11 11:11:45,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:11:45,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:45,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:11:45,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:11:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:11:45,942 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-01-11 11:11:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:46,268 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-01-11 11:11:46,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:11:46,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:11:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:46,271 INFO L225 Difference]: With dead ends: 390 [2019-01-11 11:11:46,271 INFO L226 Difference]: Without dead ends: 377 [2019-01-11 11:11:46,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:11:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-11 11:11:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-01-11 11:11:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 11:11:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-01-11 11:11:46,395 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-01-11 11:11:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:46,395 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-01-11 11:11:46,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:11:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-01-11 11:11:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:46,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:46,397 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:11:46,397 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-01-11 11:11:46,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:46,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:46,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:46,572 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-11 11:11:46,662 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-11 11:11:46,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:46,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:46,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:46,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:46,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:46,662 INFO 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-11 11:11:46,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:46,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:46,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:46,682 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-11 11:11:46,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:11:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,691 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-11 11:11:46,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,697 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-11 11:11:46,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:46,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:11:46,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:46,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,831 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-11 11:11:46,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,860 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-11 11:11:46,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:46,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,892 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:46,893 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-11 11:11:46,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,924 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-11 11:11:46,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:46,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:46,962 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-11 11:11:46,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,996 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-11 11:11:46,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:11:47,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:47,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:47,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:47,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:11:47,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:47,088 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-11 11:11:47,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:47,222 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-11 11:11:47,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:47,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:11:47,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:47,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:11:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:11:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:11:47,243 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-01-11 11:11:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:47,889 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-01-11 11:11:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:11:47,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:11:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:47,893 INFO L225 Difference]: With dead ends: 375 [2019-01-11 11:11:47,893 INFO L226 Difference]: Without dead ends: 374 [2019-01-11 11:11:47,893 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-11 11:11:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-11 11:11:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-01-11 11:11:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-11 11:11:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-01-11 11:11:48,010 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-01-11 11:11:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:48,010 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-01-11 11:11:48,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:11:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-01-11 11:11:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:48,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:48,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:48,011 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-01-11 11:11:48,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:48,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:48,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:48,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:48,169 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-11 11:11:48,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:48,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:48,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:48,169 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-11 11:11:48,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:48,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:48,172 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:48,172 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-11 11:11:48,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:48,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:48,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:48,173 INFO 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-11 11:11:48,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:48,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:48,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:48,190 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-11 11:11:48,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,232 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-11 11:11:48,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,273 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-11 11:11:48,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,282 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-11 11:11:48,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:48,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:48,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:48,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:48,328 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-11 11:11:48,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:48,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,354 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-11 11:11:48,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:48,382 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-11 11:11:48,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:48,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:48,412 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-11 11:11:48,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:48,442 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-11 11:11:48,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:48,459 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-11 11:11:48,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:48,477 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-11 11:11:48,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:48,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:11:48,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:48,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:11:48,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:11:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:11:48,496 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-01-11 11:11:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:48,790 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-01-11 11:11:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:11:48,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:11:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:48,792 INFO L225 Difference]: With dead ends: 157 [2019-01-11 11:11:48,792 INFO L226 Difference]: Without dead ends: 150 [2019-01-11 11:11:48,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:11:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-11 11:11:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-11 11:11:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 11:11:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-01-11 11:11:48,907 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-01-11 11:11:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:48,907 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-01-11 11:11:48,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:11:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-01-11 11:11:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:48,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:48,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:48,908 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-11 11:11:48,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:48,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:48,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:48,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:48,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:49,070 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-11 11:11:49,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:49,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:49,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:11:49,071 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-11 11:11:49,072 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:49,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:49,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:49,073 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-11 11:11:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:49,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:49,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:49,074 INFO 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-11 11:11:49,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:49,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:49,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:49,090 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-11 11:11:49,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,093 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-11 11:11:49,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,098 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-11 11:11:49,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,103 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-11 11:11:49,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:49,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:49,129 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:49,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:49,152 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-11 11:11:49,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:49,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,181 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-11 11:11:49,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:49,209 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-11 11:11:49,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:49,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,237 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:49,238 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-11 11:11:49,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:49,266 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-11 11:11:49,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:49,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:49,297 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-11 11:11:49,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:49,329 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-11 11:11:49,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:49,349 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-11 11:11:49,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:49,387 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-11 11:11:49,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:49,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:49,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:49,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:49,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:49,406 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-01-11 11:11:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:49,911 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-01-11 11:11:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:11:49,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:11:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:49,914 INFO L225 Difference]: With dead ends: 206 [2019-01-11 11:11:49,914 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 11:11:49,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:11:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 11:11:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-01-11 11:11:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-11 11:11:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-01-11 11:11:50,086 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-01-11 11:11:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:50,087 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-01-11 11:11:50,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-01-11 11:11:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:11:50,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:50,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:50,087 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-11 11:11:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:50,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:50,240 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-11 11:11:50,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:50,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:50,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:50,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:50,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:50,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:50,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:50,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:50,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:11:50,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:50,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:50,285 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-11 11:11:50,289 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-11 11:11:50,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,297 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-11 11:11:50,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,305 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-11 11:11:50,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:50,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:50,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:50,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:50,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-11 11:11:50,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 11:11:50,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,373 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-11 11:11:50,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:50,389 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-11 11:11:50,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:11:50,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,411 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-11 11:11:50,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:50,430 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-11 11:11:50,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-11 11:11:50,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:50,454 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:50,455 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-11 11:11:50,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:50,474 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-11 11:11:50,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:11:50,491 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-11 11:11:50,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:50,522 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-11 11:11:50,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:50,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:11:50,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:50,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:11:50,542 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-01-11 11:11:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:50,969 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-01-11 11:11:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:11:50,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:11:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:50,970 INFO L225 Difference]: With dead ends: 161 [2019-01-11 11:11:50,970 INFO L226 Difference]: Without dead ends: 156 [2019-01-11 11:11:50,971 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-11 11:11:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-11 11:11:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-01-11 11:11:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:11:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-01-11 11:11:51,034 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-01-11 11:11:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:51,034 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-01-11 11:11:51,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-01-11 11:11:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:11:51,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:51,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:51,035 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-01-11 11:11:51,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:51,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:51,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:51,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:51,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:51,161 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-11 11:11:51,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:51,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:51,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:11:51,162 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-11 11:11:51,162 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:51,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:51,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:51,165 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-11 11:11:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:51,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:51,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:51,166 INFO 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-11 11:11:51,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:51,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:51,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:51,183 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-11 11:11:51,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,188 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-11 11:11:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,194 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-11 11:11:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,202 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-11 11:11:51,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:51,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:51,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:51,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:51,248 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-11 11:11:51,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:51,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,275 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-11 11:11:51,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:51,303 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-11 11:11:51,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,337 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-11 11:11:51,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:51,364 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-11 11:11:51,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:51,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:51,393 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:51,394 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-11 11:11:51,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:51,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-11 11:11:51,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:51,448 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-11 11:11:51,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:51,482 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-11 11:11:51,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:51,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:11:51,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:51,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:11:51,502 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-01-11 11:11:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:51,873 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-01-11 11:11:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:11:51,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:11:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:51,875 INFO L225 Difference]: With dead ends: 62 [2019-01-11 11:11:51,875 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 11:11:51,876 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-11 11:11:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 11:11:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-11 11:11:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:11:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-11 11:11:51,975 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-11 11:11:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:51,975 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-11 11:11:51,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-11 11:11:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:11:51,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:51,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:51,976 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-01-11 11:11:51,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:51,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:52,530 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 11:11:52,558 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-11 11:11:52,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:52,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:52,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:11:52,558 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-01-11 11:11:52,559 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:52,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:52,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:52,562 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-11 11:11:52,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:52,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:52,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:52,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:11:52,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:52,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:52,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:52,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 11:11:52,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,587 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-11 11:11:52,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,593 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-11 11:11:52,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,602 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-11 11:11:52,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:52,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,677 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-11 11:11:52,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,704 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-11 11:11:52,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:52,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,735 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-11 11:11:52,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,768 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-11 11:11:52,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:52,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:52,796 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:52,797 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-11 11:11:52,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:52,828 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-11 11:11:52,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:52,849 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-11 11:11:52,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:52,880 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-11 11:11:52,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:52,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-11 11:11:52,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:52,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:11:52,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:11:52,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:11:52,900 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-01-11 11:11:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:53,277 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-01-11 11:11:53,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:11:53,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-11 11:11:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:53,278 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:11:53,278 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 11:11:53,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:11:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 11:11:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-11 11:11:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:11:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-11 11:11:53,402 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-11 11:11:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:53,402 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-11 11:11:53,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:11:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-11 11:11:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:11:53,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:53,403 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:53,403 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:53,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-01-11 11:11:53,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:53,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:53,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:53,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:53,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:53,573 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-11 11:11:53,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:53,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:53,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:53,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:53,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:53,574 INFO 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-11 11:11:53,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:53,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:53,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:11:53,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:53,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:53,594 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-11 11:11:53,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,600 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-11 11:11:53,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,613 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-11 11:11:53,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,621 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-11 11:11:53,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,682 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-11 11:11:53,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:53,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,707 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-11 11:11:53,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,733 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-11 11:11:53,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:53,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:53,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,794 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-11 11:11:53,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:53,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,829 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-11 11:11:53,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,866 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-11 11:11:53,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:53,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:53,900 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-11 11:11:53,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:53,936 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-11 11:11:53,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:53,957 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-11 11:11:53,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:54,027 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-11 11:11:54,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:54,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-11 11:11:54,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:54,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:11:54,048 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-01-11 11:11:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:54,543 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-01-11 11:11:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:54,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:11:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:54,544 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:11:54,544 INFO L226 Difference]: Without dead ends: 32 [2019-01-11 11:11:54,545 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-11 11:11:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-11 11:11:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-11 11:11:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:11:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-01-11 11:11:54,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-01-11 11:11:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:54,638 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-01-11 11:11:54,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-01-11 11:11:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:11:54,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:54,639 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:54,639 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-01-11 11:11:54,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:54,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:54,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:54,731 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-11 11:11:54,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:54,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:54,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:11:54,732 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-01-11 11:11:54,732 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:54,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:54,735 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:54,735 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-11 11:11:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:54,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:54,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:54,735 INFO 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-11 11:11:54,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:54,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:54,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:54,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-11 11:11:54,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,763 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-11 11:11:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,770 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-11 11:11:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,778 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-11 11:11:54,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:54,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:54,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:54,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:54,833 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-11 11:11:54,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:54,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,859 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-11 11:11:54,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:54,886 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-11 11:11:54,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:54,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,917 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-11 11:11:54,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:54,945 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-11 11:11:54,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:54,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:54,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, 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-11 11:11:54,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,007 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-11 11:11:55,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:55,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,042 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:55,043 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-11 11:11:55,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,079 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-11 11:11:55,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:55,097 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-11 11:11:55,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:55,138 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-11 11:11:55,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:55,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-11 11:11:55,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:55,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:11:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:11:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:11:55,159 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-01-11 11:11:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:55,529 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-01-11 11:11:55,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:55,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:11:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:55,530 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:11:55,531 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:11:55,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:11:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:11:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-11 11:11:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:11:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-01-11 11:11:55,655 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-01-11 11:11:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:55,655 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-01-11 11:11:55,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:11:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-01-11 11:11:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:11:55,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:55,656 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:55,656 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-01-11 11:11:55,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:55,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:55,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:55,778 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-11 11:11:55,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:55,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:55,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:55,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:55,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:55,779 INFO 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-11 11:11:55,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:55,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:55,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:11:55,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:55,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:55,795 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-11 11:11:55,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,799 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-11 11:11:55,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,807 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-11 11:11:55,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,815 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-11 11:11:55,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,861 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-11 11:11:55,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:55,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,889 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-11 11:11:55,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,917 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-11 11:11:55,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:55,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:55,949 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-11 11:11:55,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:55,980 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-11 11:11:55,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:56,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,019 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:56,020 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-11 11:11:56,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:56,055 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-11 11:11:56,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:56,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,087 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-11 11:11:56,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:56,123 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-11 11:11:56,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:56,142 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-11 11:11:56,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:56,185 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-11 11:11:56,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:56,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:11:56,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:56,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:11:56,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:11:56,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:56,205 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-01-11 11:11:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:56,642 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-01-11 11:11:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:11:56,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:11:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:56,643 INFO L225 Difference]: With dead ends: 52 [2019-01-11 11:11:56,643 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:11:56,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:11:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:11:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-11 11:11:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:11:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-01-11 11:11:56,776 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-01-11 11:11:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:56,776 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-01-11 11:11:56,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:11:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-01-11 11:11:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:11:56,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:56,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:56,777 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-01-11 11:11:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:56,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:56,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:56,956 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-11 11:11:56,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:56,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:56,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:11:56,957 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-01-11 11:11:56,957 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:11:56,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:11:56,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:11:56,960 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-11 11:11:56,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:56,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:11:56,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:56,962 INFO 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-11 11:11:56,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:56,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:56,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:56,985 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-11 11:11:56,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,990 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-11 11:11:56,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:56,996 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-11 11:11:56,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,004 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-11 11:11:57,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:57,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,079 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-11 11:11:57,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,105 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-11 11:11:57,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:57,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,335 INFO L303 Elim1Store]: Index analysis took 208 ms [2019-01-11 11:11:57,335 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-11 11:11:57,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,372 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-11 11:11:57,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:57,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,421 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:57,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:11:57,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,458 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-11 11:11:57,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:57,490 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:57,491 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-11 11:11:57,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:57,526 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-11 11:11:57,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:57,551 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-11 11:11:57,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:57,637 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-11 11:11:57,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:57,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:11:57,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:57,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:11:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:11:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:11:57,656 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-01-11 11:11:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:58,202 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-01-11 11:11:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:11:58,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:11:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:58,203 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:11:58,203 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 11:11:58,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:11:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 11:11:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-11 11:11:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:11:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-01-11 11:11:58,355 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-01-11 11:11:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:58,355 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-01-11 11:11:58,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:11:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-01-11 11:11:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:11:58,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:58,356 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:11:58,356 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:58,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:58,356 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-01-11 11:11:58,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:58,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:58,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:58,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:58,519 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 19 [2019-01-11 11:11:58,618 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-11 11:11:58,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:58,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:58,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:58,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:58,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:58,619 INFO 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-11 11:11:58,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:58,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:58,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:11:58,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:58,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:58,641 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-11 11:11:58,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,644 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-11 11:11:58,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,650 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-11 11:11:58,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,656 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-11 11:11:58,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 11:11:58,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,735 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-11 11:11:58,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,762 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-11 11:11:58,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:11:58,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,852 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:11:58,852 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-11 11:11:58,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,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-11 11:11:58,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 11:11:58,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,911 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-11 11:11:58,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:58,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-11 11:11:58,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:58,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:58,982 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-11 11:11:58,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:59,024 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-11 11:11:59,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:59,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:11:59,058 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-11 11:11:59,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:59,092 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-11 11:11:59,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:11:59,118 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-11 11:11:59,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:59,183 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-11 11:11:59,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:59,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-01-11 11:11:59,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:59,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:11:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:11:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:11:59,203 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-01-11 11:11:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:59,800 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-01-11 11:11:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:11:59,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-11 11:11:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:59,801 INFO L225 Difference]: With dead ends: 48 [2019-01-11 11:11:59,801 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 11:11:59,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:11:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 11:11:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 11:11:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 11:11:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 11:11:59,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-11 11:11:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:59,803 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 11:11:59,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:11:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 11:11:59,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 11:11:59,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 11:11:59,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:11:59,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:11:59,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:00,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:01,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:02,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:03,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:04,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:05,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:05,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:05,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:05,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:05,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:05,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:06,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:06,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:06,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:06,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:07,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:07,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:07,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:07,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:07,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:07,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:07,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:08,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:08,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:08,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:09,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:12:09,531 WARN L181 SmtUtils]: Spent 9.72 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-01-11 11:12:23,265 WARN L181 SmtUtils]: Spent 13.72 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-01-11 11:12:23,268 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 11:12:23,268 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-01-11 11:12:23,268 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-11 11:12:23,268 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-11 11:12:23,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-01-11 11:12:23,269 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-11 11:12:23,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 11:12:23,269 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-01-11 11:12:23,269 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-11 11:12:23,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-01-11 11:12:23,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-01-11 11:12:23,285 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 11:12:23 BoogieIcfgContainer [2019-01-11 11:12:23,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 11:12:23,286 INFO L168 Benchmark]: Toolchain (without parser) took 84002.06 ms. Allocated memory was 140.0 MB in the beginning and 859.3 MB in the end (delta: 719.3 MB). Free memory was 106.4 MB in the beginning and 624.2 MB in the end (delta: -517.9 MB). Peak memory consumption was 783.7 MB. Max. memory is 7.1 GB. [2019-01-11 11:12:23,287 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:12:23,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.77 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 103.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:12:23,287 INFO L168 Benchmark]: Boogie Preprocessor took 26.71 ms. Allocated memory is still 140.0 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:12:23,288 INFO L168 Benchmark]: RCFGBuilder took 462.08 ms. Allocated memory is still 140.0 MB. Free memory was 102.6 MB in the beginning and 92.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-01-11 11:12:23,288 INFO L168 Benchmark]: TraceAbstraction took 83451.72 ms. Allocated memory was 140.0 MB in the beginning and 859.3 MB in the end (delta: 719.3 MB). Free memory was 92.1 MB in the beginning and 624.2 MB in the end (delta: -532.1 MB). Peak memory consumption was 769.4 MB. Max. memory is 7.1 GB. [2019-01-11 11:12:23,290 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.17 ms. Allocated memory is still 140.0 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.77 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 103.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.71 ms. Allocated memory is still 140.0 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 462.08 ms. Allocated memory is still 140.0 MB. Free memory was 102.6 MB in the beginning and 92.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83451.72 ms. Allocated memory was 140.0 MB in the beginning and 859.3 MB in the end (delta: 719.3 MB). Free memory was 92.1 MB in the beginning and 624.2 MB in the end (delta: -532.1 MB). Peak memory consumption was 769.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - 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, 83.3s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 23.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 9.7s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 32.6s 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...