java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:06:52,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:06:52,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:06:53,011 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:06:53,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:06:53,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:06:53,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:06:53,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:06:53,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:06:53,017 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:06:53,018 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:06:53,018 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:06:53,019 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:06:53,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:06:53,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:06:53,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:06:53,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:06:53,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:06:53,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:06:53,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:06:53,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:06:53,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:06:53,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:06:53,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:06:53,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:06:53,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:06:53,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:06:53,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:06:53,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:06:53,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:06:53,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:06:53,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:06:53,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:06:53,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:06:53,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:06:53,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:06:53,065 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-31 17:06:53,089 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:06:53,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:06:53,091 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:06:53,091 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:06:53,091 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:06:53,092 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:06:53,092 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:06:53,092 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:06:53,092 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:06:53,092 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:06:53,093 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:06:53,093 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:06:53,093 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:06:53,093 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:06:53,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:06:53,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:06:53,095 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:06:53,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:06:53,095 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:06:53,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:06:53,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:06:53,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:06:53,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:06:53,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:06:53,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:06:53,098 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:06:53,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:06:53,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:06:53,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:06:53,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:06:53,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:06:53,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:53,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:06:53,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:06:53,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:06:53,100 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:06:53,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:06:53,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:06:53,101 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:06:53,101 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:06:53,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:06:53,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:06:53,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:06:53,180 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:06:53,181 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:06:53,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-31 17:06:53,182 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-31 17:06:53,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:06:53,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:06:53,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:53,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:06:53,217 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:06:53,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:53,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:06:53,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:06:53,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:06:53,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:06:53,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:06:53,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:06:53,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:06:53,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:06:53,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:06:53,772 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:06:53,772 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-31 17:06:53,773 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:53 BoogieIcfgContainer [2019-01-31 17:06:53,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:06:53,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:06:53,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:06:53,778 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:06:53,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/2) ... [2019-01-31 17:06:53,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c56882 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:06:53, skipping insertion in model container [2019-01-31 17:06:53,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:53" (2/2) ... [2019-01-31 17:06:53,786 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-31 17:06:53,809 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:06:53,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-31 17:06:53,849 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-31 17:06:53,881 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:06:53,881 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:06:53,881 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:06:53,881 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:06:53,882 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:06:53,882 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:06:53,882 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:06:53,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:06:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-31 17:06:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:06:53,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:53,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:06:53,906 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-31 17:06:53,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,095 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-31 17:06:54,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:54,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:54,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:54,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:54,113 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-31 17:06:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:54,254 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-31 17:06:54,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:54,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:06:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:54,271 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:06:54,272 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:06:54,275 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-31 17:06:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:06:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-31 17:06:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:06:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-31 17:06:54,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-31 17:06:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:54,315 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-31 17:06:54,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-31 17:06:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:54,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:54,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:54,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-31 17:06:54,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:54,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:54,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,569 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-31 17:06:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:54,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:54,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:54,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:54,600 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-31 17:06:54,640 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:54,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:54,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:54,719 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:54,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:54,725 INFO 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-31 17:06:54,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:54,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:54,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:55,048 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:06:55,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:55,370 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-31 17:06:55,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:55,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:06:55,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:06:55,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:06:55,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:06:55,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:06:55,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,719 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,742 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,757 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:55,839 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:06:55,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,970 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-31 17:06:55,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,006 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-31 17:06:56,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:56,042 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-31 17:06:56,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:56,169 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-31 17:06:56,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:56,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:56,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:56,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:56,192 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-31 17:06:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:56,815 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-31 17:06:56,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:56,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:56,819 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:06:56,819 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:06:56,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:06:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-31 17:06:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:06:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-31 17:06:56,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-31 17:06:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:56,828 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-31 17:06:56,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-31 17:06:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:56,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:56,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:56,829 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-31 17:06:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:56,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,931 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-31 17:06:56,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:56,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:56,932 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-31 17:06:56,934 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:56,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:56,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:56,943 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:56,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:56,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:56,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:56,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:57,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:57,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:57,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:06:57,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:06:57,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:06:57,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:06:57,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:06:57,265 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,298 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,335 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:57,468 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:06:57,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:06:57,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:06:57,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-31 17:06:57,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:199 [2019-01-31 17:06:57,923 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-31 17:06:57,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:57,929 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-31 17:06:57,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:57,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:06:57,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:57,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:57,949 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-31 17:06:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:57,991 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-31 17:06:57,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:57,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:06:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:57,994 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:06:57,995 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:06:57,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:06:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 17:06:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:06:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-31 17:06:57,999 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-31 17:06:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:58,000 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-31 17:06:58,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-31 17:06:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:58,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:58,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:58,001 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-31 17:06:58,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,032 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-31 17:06:58,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:58,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:58,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:58,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:58,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:58,034 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-31 17:06:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:58,081 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-31 17:06:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:58,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:06:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:58,082 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:06:58,083 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:06:58,083 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-31 17:06:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:06:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-31 17:06:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:06:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-31 17:06:58,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-31 17:06:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:58,089 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-31 17:06:58,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-31 17:06:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:58,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:58,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:58,090 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-31 17:06:58,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,154 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-31 17:06:58,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:58,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:58,155 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-31 17:06:58,157 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:58,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:58,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:58,163 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:58,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:58,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:58,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:06:58,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:06:58,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:06:58,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:06:58,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:06:58,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:58,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:58,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:58,569 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,578 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,615 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:06:58,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:06:58,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,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-31 17:06:58,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:58,716 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-31 17:06:58,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:58,728 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-31 17:06:58,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:58,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:58,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:58,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:58,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:58,748 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-31 17:06:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:58,913 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-31 17:06:58,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:58,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:58,917 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:06:58,918 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:06:58,918 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-31 17:06:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:06:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-31 17:06:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:06:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-31 17:06:58,923 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-31 17:06:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:58,923 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-31 17:06:58,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-31 17:06:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:58,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:58,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:58,925 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:58,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-31 17:06:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,995 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-31 17:06:58,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:58,995 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:58,996 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-31 17:06:58,997 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:58,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:59,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:59,003 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:59,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:59,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,004 INFO 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-31 17:06:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:59,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:06:59,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:06:59,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:06:59,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:06:59,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:06:59,248 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:59,478 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:06:59,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:59,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:59,521 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,529 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,562 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:06:59,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-31 17:06:59,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:06:59,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:06:59,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-31 17:07:00,044 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-31 17:07:00,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-31 17:07:00,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:07:00,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,365 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:00,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-31 17:07:00,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-31 17:07:00,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-31 17:07:00,674 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-01-31 17:07:00,676 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-31 17:07:00,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:00,733 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-31 17:07:00,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:00,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:00,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:00,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:00,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:00,757 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-31 17:07:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:01,258 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-31 17:07:01,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:01,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:01,261 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:07:01,261 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:01,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-31 17:07:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:07:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-31 17:07:01,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-31 17:07:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:01,270 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-31 17:07:01,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-31 17:07:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:01,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:01,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:01,271 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:01,271 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-31 17:07:01,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:01,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:01,342 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-31 17:07:01,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:01,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:01,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:01,342 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-31 17:07:01,345 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:01,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:01,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:01,355 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:01,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:01,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:01,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:01,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:01,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:01,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:01,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:01,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:01,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:01,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:01,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:07:01,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:01,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:01,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:01,689 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,696 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,705 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,740 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:07:01,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-31 17:07:01,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,790 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-31 17:07:01,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-31 17:07:01,806 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-31 17:07:01,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:01,821 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-31 17:07:01,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:01,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:07:01,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:01,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:01,841 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-31 17:07:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:01,959 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-31 17:07:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:01,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:07:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:01,960 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:07:01,961 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:07:01,961 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-31 17:07:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:07:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-31 17:07:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:07:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-31 17:07:01,976 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-31 17:07:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:01,976 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-31 17:07:01,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-31 17:07:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:01,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:01,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:01,979 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-31 17:07:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,118 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-31 17:07:02,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:02,119 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:02,120 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-31 17:07:02,121 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:02,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:02,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:02,126 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:02,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:02,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:02,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,127 INFO 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-31 17:07:02,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:02,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:02,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:02,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:02,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:02,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:02,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:02,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:02,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:02,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:02,381 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,391 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,400 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:02,422 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:02,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,474 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-31 17:07:02,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,527 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-31 17:07:02,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:02,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,571 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:02,572 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-31 17:07:02,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,614 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-31 17:07:02,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-31 17:07:02,635 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-31 17:07:02,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:02,687 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-31 17:07:02,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:02,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:02,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:02,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:02,707 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-31 17:07:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:03,226 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-31 17:07:03,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:03,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:03,229 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:07:03,229 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:03,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-31 17:07:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:07:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-31 17:07:03,238 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-31 17:07:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:03,238 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-31 17:07:03,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-31 17:07:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:03,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:03,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:03,240 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,240 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-31 17:07:03,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,387 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-31 17:07:03,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:03,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:03,388 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-31 17:07:03,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:03,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:03,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:03,394 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:03,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,395 INFO 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-31 17:07:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:03,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:03,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:03,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:03,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:03,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:03,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:03,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:03,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:03,580 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,601 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,618 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,630 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,664 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:03,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,715 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-31 17:07:03,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,736 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-31 17:07:03,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:03,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,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 67 [2019-01-31 17:07:03,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,815 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-31 17:07:03,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:03,830 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-31 17:07:03,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:03,854 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-31 17:07:03,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:03,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:03,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:03,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:03,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:03,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:03,875 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-31 17:07:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:04,232 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-31 17:07:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:04,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:04,233 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:07:04,234 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 17:07:04,234 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-31 17:07:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 17:07:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-31 17:07:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:07:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-31 17:07:04,242 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-31 17:07:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:04,242 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-31 17:07:04,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-31 17:07:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:04,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:04,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:04,244 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-31 17:07:04,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,315 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-31 17:07:04,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:04,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:04,316 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-31 17:07:04,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:04,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:04,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:04,321 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:04,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,322 INFO 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-31 17:07:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:04,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:04,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:04,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:04,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:04,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:04,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:04,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:04,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:04,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:04,663 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,680 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,723 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,740 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,769 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:04,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:07:04,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:04,859 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-31 17:07:04,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:04,871 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-31 17:07:04,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:04,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:04,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:04,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:04,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:04,892 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-31 17:07:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:05,044 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-31 17:07:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:05,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:07:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:05,045 INFO L225 Difference]: With dead ends: 42 [2019-01-31 17:07:05,046 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 17:07:05,046 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-31 17:07:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 17:07:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-31 17:07:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:07:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-31 17:07:05,054 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-31 17:07:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:05,055 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-31 17:07:05,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-31 17:07:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:05,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:05,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:05,056 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-31 17:07:05,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:05,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:05,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:05,135 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-31 17:07:05,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:05,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:05,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:05,136 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-31 17:07:05,137 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:05,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:05,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:05,141 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:05,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:05,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:05,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:05,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:05,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:05,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:05,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:05,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:05,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:05,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:05,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:05,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:05,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:05,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:05,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:05,530 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,554 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,577 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,599 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:05,635 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:05,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:05,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:05,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:05,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:07:05,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:05,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:07:05,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-31 17:07:05,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:05,809 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-31 17:07:05,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:05,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:05,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:05,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:05,830 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-31 17:07:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:06,223 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-31 17:07:06,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:06,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:06,224 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:07:06,225 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:07:06,225 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-31 17:07:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:07:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-31 17:07:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 17:07:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-31 17:07:06,235 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-31 17:07:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:06,236 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-31 17:07:06,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-31 17:07:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:06,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:06,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:06,237 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,237 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-31 17:07:06,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:06,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,381 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-31 17:07:06,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:06,382 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:06,382 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-31 17:07:06,383 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:06,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:06,387 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:06,387 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:06,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,388 INFO 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-31 17:07:06,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:06,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:06,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:06,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:06,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:06,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:06,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:06,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:06,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:06,552 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,583 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:06,628 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:06,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,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 51 [2019-01-31 17:07:06,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,685 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-31 17:07:06,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:06,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:06,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:06,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:07:06,763 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-31 17:07:06,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:06,794 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-31 17:07:06,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:06,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:06,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:06,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:06,814 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-31 17:07:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:07,131 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-31 17:07:07,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:07,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:07,133 INFO L225 Difference]: With dead ends: 63 [2019-01-31 17:07:07,133 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:07:07,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:07:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-31 17:07:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:07:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-31 17:07:07,143 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-31 17:07:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:07,143 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-31 17:07:07,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-31 17:07:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:07,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:07,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:07,144 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:07,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-31 17:07:07,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:07,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:07,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:07,200 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-31 17:07:07,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:07,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:07:07,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:07,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:07:07,201 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-31 17:07:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:07,322 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-31 17:07:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:07,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:07:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:07,323 INFO L225 Difference]: With dead ends: 41 [2019-01-31 17:07:07,324 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 17:07:07,324 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-31 17:07:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 17:07:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-31 17:07:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:07:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-31 17:07:07,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-31 17:07:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:07,334 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-31 17:07:07,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-31 17:07:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:07,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:07,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:07,336 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-31 17:07:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:07,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:07,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:07,427 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-31 17:07:07,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:07,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:07,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:07,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:07,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:07,428 INFO 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-31 17:07:07,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:07,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:07,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:07:07,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:07,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:07,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:07,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:07,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:07,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:07,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:07,511 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:07,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:07,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:07,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:07,742 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,759 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,775 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,823 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:08,067 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-31 17:07:08,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:08,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,301 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-31 17:07:08,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:08,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,335 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:08,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-31 17:07:08,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-31 17:07:08,384 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-31 17:07:08,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:08,411 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-31 17:07:08,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:08,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:08,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:08,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:08,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:08,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:08,431 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-31 17:07:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:09,081 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-31 17:07:09,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:09,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:09,083 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:07:09,083 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:09,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-31 17:07:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:07:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-31 17:07:09,094 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-31 17:07:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:09,094 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-31 17:07:09,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-31 17:07:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:09,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:09,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:09,096 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-31 17:07:09,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:09,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:09,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:09,376 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-31 17:07:09,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:09,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:09,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:09,378 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-31 17:07:09,379 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:09,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:09,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:09,386 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:09,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:09,387 INFO 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-31 17:07:09,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:09,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:09,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:09,587 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-31 17:07:09,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:09,856 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:07:09,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:09,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:09,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:09,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:09,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:09,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:10,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:10,005 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,022 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,036 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,057 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:10,079 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:10,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,105 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-31 17:07:10,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,126 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-31 17:07:10,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:10,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,149 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-31 17:07:10,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,185 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-31 17:07:10,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:10,201 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-31 17:07:10,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:10,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:10,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:10,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:10,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:10,239 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-31 17:07:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:10,651 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-31 17:07:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:10,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:10,653 INFO L225 Difference]: With dead ends: 61 [2019-01-31 17:07:10,653 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 17:07:10,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 17:07:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-31 17:07:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:07:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-31 17:07:10,664 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-31 17:07:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:10,664 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-31 17:07:10,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-31 17:07:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:10,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:10,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:10,666 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,666 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-31 17:07:10,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,712 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-31 17:07:10,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:10,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:10,713 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-31 17:07:10,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:10,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:10,720 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:10,720 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:10,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:10,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,721 INFO 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-31 17:07:10,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:10,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:10,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:10,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:10,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:10,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:10,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:10,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:10,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:10,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:11,004 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,045 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,160 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:11,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:07:11,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:11,278 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-31 17:07:11,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:11,287 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-31 17:07:11,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:11,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:11,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:11,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:11,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:11,307 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-31 17:07:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:11,446 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-31 17:07:11,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:11,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:07:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:11,447 INFO L225 Difference]: With dead ends: 53 [2019-01-31 17:07:11,447 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 17:07:11,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:07:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 17:07:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-31 17:07:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:07:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-31 17:07:11,459 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-31 17:07:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:11,460 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-31 17:07:11,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-31 17:07:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:11,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:11,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:11,461 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,461 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-31 17:07:11,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:11,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,524 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-31 17:07:11,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:11,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:11,525 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-31 17:07:11,526 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:11,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:11,530 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:11,530 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:11,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,531 INFO 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-31 17:07:11,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:11,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:11,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:11,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:11,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:11,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:11,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:11,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:11,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:11,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:11,836 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,853 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,870 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,886 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,955 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:11,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:11,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,025 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-31 17:07:12,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:12,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:07:12,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:07:12,141 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-31 17:07:12,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:12,163 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-31 17:07:12,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:12,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:12,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:12,183 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-31 17:07:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:12,724 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-31 17:07:12,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:12,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:12,726 INFO L225 Difference]: With dead ends: 69 [2019-01-31 17:07:12,726 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 17:07:12,727 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-31 17:07:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 17:07:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-31 17:07:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:07:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-31 17:07:12,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-31 17:07:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:12,740 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-31 17:07:12,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-31 17:07:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:12,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:12,741 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:07:12,741 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:12,742 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-31 17:07:12,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:12,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,831 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-31 17:07:12,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:12,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:12,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:12,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:12,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:12,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:12,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:12,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:12,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:12,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:12,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:12,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:12,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:12,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:12,957 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:13,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:13,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:13,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:13,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,400 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,415 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,460 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:13,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:13,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,516 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-31 17:07:13,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:13,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-31 17:07:13,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-31 17:07:13,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:07:13,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:13,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-31 17:07:13,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:13,672 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-31 17:07:13,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:13,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 17:07:13,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:13,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:13,691 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-31 17:07:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:14,007 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-31 17:07:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:14,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:07:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:14,009 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:07:14,009 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:07:14,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:07:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-31 17:07:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 17:07:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-31 17:07:14,022 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-31 17:07:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:14,023 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-31 17:07:14,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-31 17:07:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:14,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:14,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:14,024 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-31 17:07:14,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,163 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-31 17:07:14,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:14,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:14,164 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-31 17:07:14,165 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:14,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:14,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:14,168 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:14,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,169 INFO 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-31 17:07:14,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:14,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:14,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:14,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:14,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:14,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:14,257 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:14,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:14,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:14,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:14,434 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,449 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,461 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:14,504 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:07:14,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,636 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-31 17:07:14,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:14,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-31 17:07:14,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:14,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-31 17:07:14,724 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-31 17:07:14,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:14,742 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-31 17:07:14,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:14,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:14,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:14,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:14,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:14,762 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-31 17:07:15,186 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-31 17:07:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:15,388 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-31 17:07:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:15,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:15,390 INFO L225 Difference]: With dead ends: 84 [2019-01-31 17:07:15,391 INFO L226 Difference]: Without dead ends: 78 [2019-01-31 17:07:15,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-31 17:07:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-31 17:07:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 17:07:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-31 17:07:15,409 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-31 17:07:15,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:15,409 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-31 17:07:15,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-31 17:07:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:15,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:15,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:15,410 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-31 17:07:15,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:15,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,565 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-31 17:07:15,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:15,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:15,566 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-31 17:07:15,569 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:15,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:15,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:15,573 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:15,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,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 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-31 17:07:15,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:15,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:15,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:15,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:15,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:15,689 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,721 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,757 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:15,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:15,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:15,910 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,920 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,929 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:15,951 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:15,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-31 17:07:15,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:16,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:16,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-31 17:07:16,576 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-31 17:07:16,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,898 INFO L303 Elim1Store]: Index analysis took 316 ms [2019-01-31 17:07:17,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-31 17:07:17,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:07:17,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,992 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:17,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-31 17:07:17,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-31 17:07:18,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-31 17:07:18,262 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-31 17:07:18,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,299 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:18,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-01-31 17:07:18,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-01-31 17:07:18,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,477 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:18,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-31 17:07:18,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,561 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:18,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-31 17:07:18,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-31 17:07:18,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-31 17:07:18,735 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-31 17:07:18,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:18,795 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-31 17:07:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:18,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:18,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:18,815 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-31 17:07:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:19,618 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-31 17:07:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:07:19,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:19,621 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:07:19,621 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:07:19,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:07:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-31 17:07:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:07:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-31 17:07:19,638 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-31 17:07:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:19,638 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-31 17:07:19,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-31 17:07:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:19,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:19,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:19,639 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:19,640 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-31 17:07:19,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:19,720 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-31 17:07:19,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:19,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:19,721 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:19,722 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-31 17:07:19,723 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:19,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:19,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:19,727 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:19,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:19,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:19,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:19,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:19,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:19,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:19,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:19,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:19,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:19,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:19,797 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,822 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:19,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:19,945 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,955 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,964 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,986 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:20,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,098 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-31 17:07:20,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:20,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,126 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-31 17:07:20,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,146 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-31 17:07:20,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:20,164 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-31 17:07:20,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:20,185 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-31 17:07:20,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:20,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:20,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:20,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:20,204 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-31 17:07:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:20,561 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-31 17:07:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:20,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:20,562 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:07:20,563 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 17:07:20,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 17:07:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-31 17:07:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:07:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-31 17:07:20,576 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-31 17:07:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:20,577 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-31 17:07:20,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-31 17:07:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:20,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:20,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:20,578 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:20,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,578 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-31 17:07:20,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,755 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-31 17:07:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:20,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:20,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:20,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,756 INFO 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-31 17:07:20,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:20,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:20,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:20,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:20,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:20,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:20,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:20,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:20,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:20,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,944 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:20,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:20,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:20,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:20,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:20,999 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,022 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,036 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,046 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,056 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,086 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:21,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,146 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-31 17:07:21,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:21,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:21,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-31 17:07:21,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,208 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-31 17:07:21,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-31 17:07:21,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-31 17:07:21,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:07:21,295 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-31 17:07:21,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:21,343 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-31 17:07:21,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:21,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:21,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:21,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:21,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:21,365 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-31 17:07:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:21,932 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-31 17:07:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:21,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:21,935 INFO L225 Difference]: With dead ends: 88 [2019-01-31 17:07:21,935 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 17:07:21,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 17:07:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-31 17:07:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:07:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-31 17:07:21,955 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-31 17:07:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:21,955 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-31 17:07:21,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-31 17:07:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:21,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:21,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:21,956 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-31 17:07:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:21,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:21,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,237 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-31 17:07:22,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:22,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:22,238 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-31 17:07:22,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:22,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:22,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:22,242 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:22,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,243 INFO 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-31 17:07:22,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:22,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:22,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:22,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:22,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:22,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:22,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:07:22,329 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,348 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:22,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:22,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:22,451 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,459 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,468 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:22,486 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:07:22,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,521 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-31 17:07:22,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,531 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-31 17:07:22,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:22,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,552 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-31 17:07:22,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:22,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-31 17:07:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:22,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:22,600 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-31 17:07:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:22,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:22,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:22,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:22,621 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-31 17:07:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:22,874 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-31 17:07:22,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:22,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:22,876 INFO L225 Difference]: With dead ends: 81 [2019-01-31 17:07:22,876 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:07:22,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:07:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-31 17:07:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:07:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-31 17:07:22,892 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-31 17:07:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:22,892 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-31 17:07:22,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-31 17:07:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:22,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:22,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:22,893 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-31 17:07:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,067 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-31 17:07:23,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:23,068 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:23,068 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-31 17:07:23,070 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:23,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:23,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:23,074 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:23,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,075 INFO 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-31 17:07:23,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:23,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:23,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:23,295 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-31 17:07:23,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:23,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:23,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:23,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:23,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:23,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:23,359 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,377 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,390 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,410 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:23,430 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:23,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,475 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-31 17:07:23,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,493 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-31 17:07:23,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:23,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:23,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,557 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-31 17:07:23,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:23,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,584 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:23,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-31 17:07:23,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,608 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-31 17:07:23,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:07:23,624 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-31 17:07:23,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:23,672 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-31 17:07:23,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:23,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:23,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:23,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:23,693 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-31 17:07:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:24,162 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-31 17:07:24,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:24,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:24,165 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:07:24,165 INFO L226 Difference]: Without dead ends: 112 [2019-01-31 17:07:24,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-31 17:07:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-31 17:07:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-31 17:07:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-31 17:07:24,187 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-31 17:07:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:24,187 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-31 17:07:24,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-31 17:07:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:24,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:24,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:24,188 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-31 17:07:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:24,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:24,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:24,291 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-31 17:07:24,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:24,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:24,292 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-31 17:07:24,297 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:24,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:24,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:24,303 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:24,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:24,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:24,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:24,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:24,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:24,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:24,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:24,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:24,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:24,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:24,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:24,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:24,544 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,554 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,563 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,585 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:24,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:24,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:07:24,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-31 17:07:24,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-31 17:07:24,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2019-01-31 17:07:24,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,029 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:25,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-31 17:07:25,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 73 [2019-01-31 17:07:25,090 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-31 17:07:25,151 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:138, output treesize:96 [2019-01-31 17:07:25,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,235 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:25,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-31 17:07:25,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-31 17:07:25,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-31 17:07:25,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-31 17:07:25,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-31 17:07:25,508 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-31 17:07:25,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:25,527 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-31 17:07:25,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:25,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-31 17:07:25,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:25,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:25,547 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-31 17:07:25,890 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 26 [2019-01-31 17:07:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:26,520 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-31 17:07:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:07:26,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:26,522 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:07:26,522 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:07:26,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:07:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-31 17:07:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:07:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-31 17:07:26,556 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-31 17:07:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:26,556 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-31 17:07:26,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-31 17:07:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:26,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:26,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:26,557 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-31 17:07:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:26,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:26,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:26,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:26,657 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-31 17:07:26,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:26,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:26,657 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-31 17:07:26,658 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:26,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:26,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:26,661 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:26,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:26,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,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 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-31 17:07:26,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:26,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:26,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:26,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:26,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:26,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:26,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:26,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,856 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:26,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:26,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:26,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:26,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:26,913 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,952 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,964 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,974 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:27,005 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:27,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:27,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:27,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:27,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,096 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:27,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:07:27,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:27,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-31 17:07:27,148 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-31 17:07:27,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:27,206 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-31 17:07:27,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:27,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:27,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:27,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:27,226 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-31 17:07:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:27,554 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-31 17:07:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:27,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:27,557 INFO L225 Difference]: With dead ends: 120 [2019-01-31 17:07:27,557 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:07:27,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:07:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-31 17:07:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:07:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-31 17:07:27,597 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-31 17:07:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:27,604 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-31 17:07:27,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-31 17:07:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:27,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:27,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:27,606 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-31 17:07:27,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:27,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,663 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-31 17:07:27,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:27,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:27,664 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-31 17:07:27,665 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:27,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:27,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:27,668 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:27,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,669 INFO 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-31 17:07:27,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:27,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:27,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:27,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:27,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:27,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:27,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,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 27 treesize of output 62 [2019-01-31 17:07:27,765 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:27,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,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 36 treesize of output 49 [2019-01-31 17:07:27,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:27,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:27,953 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,968 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,999 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:28,025 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:28,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:07:28,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:28,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:28,187 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-31 17:07:28,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:28,192 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-31 17:07:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:07:28,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:28,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:07:28,213 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-31 17:07:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:28,343 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-31 17:07:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:28,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:07:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:28,345 INFO L225 Difference]: With dead ends: 105 [2019-01-31 17:07:28,345 INFO L226 Difference]: Without dead ends: 104 [2019-01-31 17:07:28,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:07:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-31 17:07:28,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-31 17:07:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:07:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-31 17:07:28,393 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-31 17:07:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:28,394 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-31 17:07:28,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-31 17:07:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:28,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:28,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:28,395 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-31 17:07:28,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:28,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:28,979 WARN L181 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-31 17:07:29,201 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-31 17:07:29,247 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-31 17:07:29,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:29,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:29,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:29,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:29,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:29,249 INFO 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-31 17:07:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:07:29,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:07:29,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:07:29,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:29,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:29,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:29,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:29,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:29,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,331 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:29,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:29,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:29,583 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,593 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,602 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:29,622 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:29,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:29,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:07:29,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-31 17:07:29,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:199 [2019-01-31 17:07:29,985 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-01-31 17:07:30,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-31 17:07:30,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,120 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:30,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-31 17:07:30,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-31 17:07:30,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,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 43 treesize of output 65 [2019-01-31 17:07:30,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-31 17:07:30,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:181, output treesize:121 [2019-01-31 17:07:30,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,449 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:30,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-31 17:07:30,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-01-31 17:07:30,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,624 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:30,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-31 17:07:30,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,716 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:30,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-31 17:07:30,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-31 17:07:30,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-31 17:07:30,871 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-31 17:07:30,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:30,941 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-31 17:07:30,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:30,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:30,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:30,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:30,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:30,962 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-31 17:07:31,401 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-31 17:07:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:31,714 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-31 17:07:31,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:31,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:31,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:31,717 INFO L225 Difference]: With dead ends: 131 [2019-01-31 17:07:31,717 INFO L226 Difference]: Without dead ends: 130 [2019-01-31 17:07:31,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-31 17:07:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-31 17:07:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:07:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-31 17:07:31,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-31 17:07:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:31,740 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-31 17:07:31,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-31 17:07:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:31,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:31,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:31,741 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-31 17:07:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:31,992 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-31 17:07:32,006 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-31 17:07:32,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:32,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:32,007 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:32,007 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-31 17:07:32,009 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:32,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:32,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:32,011 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:32,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:32,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:32,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 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-31 17:07:32,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:32,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:32,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:32,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:32,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:32,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:32,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:32,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:32,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:32,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:32,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,352 INFO L303 Elim1Store]: Index analysis took 153 ms [2019-01-31 17:07:32,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:32,597 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-01-31 17:07:32,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:32,607 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,620 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,635 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,651 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:32,679 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:32,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:07:32,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,732 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-31 17:07:32,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:32,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,782 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:32,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-01-31 17:07:32,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:32,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:07:32,829 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-31 17:07:32,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:32,854 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-31 17:07:32,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:32,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:32,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:32,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:32,875 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-31 17:07:33,482 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-31 17:07:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:33,703 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-31 17:07:33,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:33,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:33,705 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:07:33,705 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 17:07:33,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 17:07:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-31 17:07:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 17:07:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-31 17:07:33,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-31 17:07:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:33,735 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-31 17:07:33,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-31 17:07:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:33,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:33,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:33,735 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:33,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-31 17:07:33,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:33,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:33,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:33,791 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-31 17:07:33,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:33,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:33,792 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-31 17:07:33,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:33,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:33,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:33,795 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:33,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:33,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,796 INFO 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-31 17:07:33,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:33,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:33,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:33,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:33,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:33,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:33,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:33,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:33,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:33,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:33,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:33,982 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,000 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,013 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,033 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:34,054 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:34,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,078 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-31 17:07:34,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,097 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-31 17:07:34,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:34,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,119 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-31 17:07:34,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,140 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-31 17:07:34,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:07:34,155 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-31 17:07:34,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:34,166 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-31 17:07:34,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:34,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:34,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:34,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:34,185 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-31 17:07:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:34,454 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-31 17:07:34,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:34,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:34,455 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:07:34,455 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 17:07:34,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 17:07:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-31 17:07:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:07:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-31 17:07:34,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-31 17:07:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:34,482 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-31 17:07:34,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-31 17:07:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:34,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:34,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:34,482 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-31 17:07:34,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:34,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:34,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:34,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:34,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:34,579 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-31 17:07:34,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:34,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:34,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:34,579 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-31 17:07:34,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:34,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:34,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:34,583 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:34,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:34,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:34,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:34,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:34,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:34,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:34,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:34,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:34,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:34,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:34,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:34,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,677 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:34,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:34,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:34,799 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,809 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,818 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:34,840 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:34,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,876 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-31 17:07:34,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,897 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-31 17:07:34,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:34,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,922 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:34,923 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-31 17:07:34,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,942 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-31 17:07:34,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:07:34,960 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-31 17:07:34,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:34,983 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-31 17:07:35,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:35,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-31 17:07:35,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:35,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:35,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:35,002 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-31 17:07:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:35,239 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-31 17:07:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:35,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:07:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:35,241 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:07:35,241 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:07:35,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:07:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-31 17:07:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 17:07:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-31 17:07:35,272 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-31 17:07:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:35,273 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-31 17:07:35,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-31 17:07:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:35,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:35,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:35,274 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:35,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:35,274 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-31 17:07:35,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:35,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:35,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:35,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:35,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:35,328 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-31 17:07:35,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:35,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:07:35,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:35,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:07:35,329 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-31 17:07:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:35,400 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-31 17:07:35,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:35,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:07:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:35,401 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:07:35,401 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:07:35,402 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-31 17:07:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:07:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-31 17:07:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:07:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-31 17:07:35,438 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-31 17:07:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:35,439 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-31 17:07:35,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-31 17:07:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:35,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:35,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:35,440 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-31 17:07:35,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:35,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:35,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:35,656 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-31 17:07:35,833 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-31 17:07:35,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:35,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:35,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:35,834 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-31 17:07:35,835 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:35,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:35,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:35,838 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:35,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:35,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:35,839 INFO 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-31 17:07:35,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:35,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:35,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:35,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:36,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:36,222 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-31 17:07:36,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:36,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:36,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:36,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:36,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:36,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:07:36,317 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,339 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,362 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,371 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,379 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:36,398 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:07:36,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:36,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:36,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:36,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-31 17:07:36,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:36,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,579 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-31 17:07:36,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-31 17:07:36,591 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-31 17:07:36,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:36,602 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-31 17:07:36,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:36,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:36,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:36,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:36,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:36,622 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-31 17:07:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:36,871 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-31 17:07:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:36,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:36,873 INFO L225 Difference]: With dead ends: 83 [2019-01-31 17:07:36,873 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 17:07:36,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 17:07:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-31 17:07:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 17:07:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-31 17:07:36,921 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-31 17:07:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:36,921 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-31 17:07:36,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-31 17:07:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:36,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:36,922 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:07:36,922 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-31 17:07:36,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:36,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:36,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:36,978 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-31 17:07:36,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:36,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:36,978 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:36,979 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-31 17:07:36,979 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:36,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:36,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:36,981 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:36,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:36,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:36,985 INFO 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-31 17:07:36,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:36,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:36,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:37,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:37,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:37,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:37,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:37,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:37,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:37,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:37,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:07:37,121 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,147 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,157 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:37,187 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:07:37,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:37,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,223 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-31 17:07:37,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:37,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-01-31 17:07:37,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:37,255 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-31 17:07:37,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-31 17:07:37,271 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-31 17:07:37,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:37,290 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-31 17:07:37,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:37,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:37,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:37,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:37,311 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-31 17:07:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:37,754 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-31 17:07:37,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:37,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:37,756 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:07:37,756 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:07:37,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:07:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-31 17:07:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 17:07:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-31 17:07:37,816 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-31 17:07:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:37,817 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-31 17:07:37,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-31 17:07:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:37,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:37,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:37,818 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-31 17:07:37,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:37,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:37,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:37,955 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-31 17:07:37,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:37,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:37,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:37,956 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-31 17:07:37,957 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:37,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:37,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:37,961 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:37,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:37,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:37,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 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-31 17:07:37,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:37,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:37,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:38,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:38,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:38,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:38,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:38,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:38,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:38,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:38,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:38,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:38,196 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,220 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,244 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,253 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:38,282 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:38,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:38,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,373 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-31 17:07:38,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:38,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:07:38,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,478 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-31 17:07:38,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:38,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,512 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:38,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-31 17:07:38,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:38,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:07:38,568 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-31 17:07:38,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:38,737 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-31 17:07:38,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:38,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:38,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:38,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:38,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:38,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:38,758 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-31 17:07:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:39,325 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-31 17:07:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:39,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:39,327 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:07:39,327 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:07:39,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:07:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-31 17:07:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-31 17:07:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-31 17:07:39,404 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-31 17:07:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:39,404 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-31 17:07:39,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-31 17:07:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:39,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:39,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:39,405 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-31 17:07:39,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,475 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-31 17:07:39,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:39,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:39,476 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-31 17:07:39,477 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:39,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:39,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:39,480 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:39,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,480 INFO 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-31 17:07:39,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:39,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:39,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:39,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:39,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:39,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:39,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:39,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:39,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:39,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:39,734 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,756 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,778 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:39,817 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:39,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,864 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-31 17:07:39,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,882 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-31 17:07:39,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:39,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:39,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,934 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-31 17:07:39,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:39,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:39,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:39,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,994 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-31 17:07:39,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:40,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:40,051 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-31 17:07:40,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:40,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:40,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:40,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:40,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:40,072 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-31 17:07:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:40,541 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-31 17:07:40,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:40,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:40,543 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:07:40,543 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:07:40,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:07:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-31 17:07:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:07:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-31 17:07:40,648 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-31 17:07:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:40,649 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-31 17:07:40,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-31 17:07:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:40,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:40,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:40,650 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-31 17:07:40,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:40,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:40,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:40,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:40,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:40,714 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-31 17:07:40,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:40,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:40,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:40,715 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-31 17:07:40,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:40,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:40,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:40,719 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:40,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:40,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:40,719 INFO 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-31 17:07:40,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:40,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:40,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:40,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:40,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:40,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:40,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:40,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:40,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:40,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:40,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:40,867 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,884 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,906 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,926 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:40,947 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:40,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,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, 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-31 17:07:40,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,007 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-31 17:07:41,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:41,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,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-31 17:07:41,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,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-31 17:07:41,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:41,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,084 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:41,085 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-31 17:07:41,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:41,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:41,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:41,217 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-31 17:07:41,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:41,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:41,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:41,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:41,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:41,237 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-31 17:07:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:41,839 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-31 17:07:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:41,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:41,841 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:07:41,841 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:07:41,842 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-31 17:07:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:07:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-31 17:07:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:07:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-31 17:07:41,948 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-31 17:07:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:41,949 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-31 17:07:41,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-31 17:07:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:41,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:41,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:41,950 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-31 17:07:41,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:41,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:42,036 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-31 17:07:42,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:42,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:42,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:42,036 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-31 17:07:42,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:42,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:42,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:42,043 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:42,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:42,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:42,044 INFO 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-31 17:07:42,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:42,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:42,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:42,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:42,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:42,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:42,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:42,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:42,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,139 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:42,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:42,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:42,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:42,296 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,312 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,326 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,342 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:42,371 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:42,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:42,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,424 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-31 17:07:42,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:42,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:42,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,472 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-31 17:07:42,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:07:42,492 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-31 17:07:42,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:42,514 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-31 17:07:42,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:42,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:42,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:42,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:42,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:42,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:42,534 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-31 17:07:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:42,919 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-31 17:07:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:42,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:42,921 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:07:42,921 INFO L226 Difference]: Without dead ends: 98 [2019-01-31 17:07:42,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-31 17:07:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-31 17:07:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:07:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-31 17:07:43,033 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-31 17:07:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:43,033 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-31 17:07:43,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-31 17:07:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:43,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:43,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:43,034 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:43,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:43,034 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-31 17:07:43,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:43,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:43,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:43,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:43,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:43,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-31 17:07:43,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:43,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:43,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:43,162 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-31 17:07:43,163 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:43,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:43,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:43,166 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:43,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:43,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:43,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:43,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 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-31 17:07:43,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:43,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:43,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:43,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:43,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:43,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:43,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:43,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:43,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:43,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:43,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:43,329 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,362 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,373 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:43,405 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:43,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:43,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:07:43,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-31 17:07:43,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-31 17:07:43,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2019-01-31 17:07:43,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,821 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:43,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-31 17:07:43,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,901 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:43,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-31 17:07:43,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-31 17:07:43,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:142, output treesize:92 [2019-01-31 17:07:44,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-31 17:07:44,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2019-01-31 17:07:44,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,137 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:44,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-31 17:07:44,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-31 17:07:44,183 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-31 17:07:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:44,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:44,358 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-31 17:07:44,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:44,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:44,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:44,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:44,378 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-31 17:07:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:45,329 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-31 17:07:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:45,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:45,331 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:07:45,331 INFO L226 Difference]: Without dead ends: 123 [2019-01-31 17:07:45,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-31 17:07:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-31 17:07:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:07:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-31 17:07:45,442 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-31 17:07:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:45,442 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-31 17:07:45,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-31 17:07:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:45,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:45,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:45,443 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-31 17:07:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:45,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:45,592 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-31 17:07:45,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:45,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:45,593 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:45,593 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-31 17:07:45,594 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:45,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:45,596 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:45,597 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:45,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:45,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:45,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:45,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:45,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:45,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:45,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:45,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:45,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:45,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:45,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:45,656 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,682 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:45,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:45,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:45,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:45,862 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,879 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,910 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:45,939 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:45,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:45,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,997 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-31 17:07:45,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:46,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,027 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:46,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:07:46,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,060 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-31 17:07:46,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-31 17:07:46,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:46,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:07:46,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:46,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:07:46,150 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-31 17:07:46,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:46,186 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-31 17:07:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:07:46,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:46,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:46,205 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-31 17:07:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:46,873 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-31 17:07:46,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:46,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:07:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:46,875 INFO L225 Difference]: With dead ends: 114 [2019-01-31 17:07:46,875 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:07:46,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:07:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-31 17:07:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:07:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-31 17:07:46,997 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-31 17:07:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:46,998 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-31 17:07:46,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-31 17:07:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:46,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:46,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:46,998 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-31 17:07:46,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:46,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:46,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:46,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:46,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:47,099 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-31 17:07:47,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:47,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:47,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:47,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:47,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:47,100 INFO 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-31 17:07:47,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:47,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:47,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:47,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:47,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:47,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:47,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:47,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:47,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:47,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:47,155 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:07:47,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:47,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:47,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:07:47,362 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,377 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,408 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:47,437 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:07:47,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:47,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,488 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-31 17:07:47,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:07:47,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,546 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-31 17:07:47,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:07:47,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,577 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:47,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:07:47,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:47,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:07:47,628 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-31 17:07:47,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:47,653 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-31 17:07:47,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:47,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:47,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:47,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:47,672 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-31 17:07:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:48,241 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-31 17:07:48,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:48,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:48,243 INFO L225 Difference]: With dead ends: 164 [2019-01-31 17:07:48,243 INFO L226 Difference]: Without dead ends: 163 [2019-01-31 17:07:48,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-31 17:07:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-31 17:07:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-31 17:07:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-31 17:07:48,476 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-31 17:07:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:48,476 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-31 17:07:48,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-31 17:07:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:48,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:48,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:48,477 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:48,477 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-31 17:07:48,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:48,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:48,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:48,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:48,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:48,533 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-31 17:07:48,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:48,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:48,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:48,534 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-31 17:07:48,535 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:48,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:48,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:48,537 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:48,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:48,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:48,538 INFO 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-31 17:07:48,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:48,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:48,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:48,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:48,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:48,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:48,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:48,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:48,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:48,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:48,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:48,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:48,744 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,766 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,778 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,788 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,797 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:48,824 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:48,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:07:48,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,873 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-31 17:07:48,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:48,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:07:48,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:49,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:49,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:07:49,036 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-31 17:07:49,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:49,056 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-31 17:07:49,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:49,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:49,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:49,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:49,076 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-31 17:07:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:49,563 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-31 17:07:49,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:49,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:49,565 INFO L225 Difference]: With dead ends: 160 [2019-01-31 17:07:49,566 INFO L226 Difference]: Without dead ends: 159 [2019-01-31 17:07:49,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-31 17:07:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-31 17:07:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-31 17:07:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-31 17:07:50,048 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-31 17:07:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:50,048 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-31 17:07:50,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-31 17:07:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:50,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:50,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:50,049 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-31 17:07:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:50,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:50,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:50,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:50,161 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-31 17:07:50,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:50,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:50,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:50,162 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-31 17:07:50,163 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:50,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:50,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:50,167 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:50,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:50,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:50,168 INFO 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-31 17:07:50,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:50,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:50,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:50,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:50,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:50,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:50,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:07:50,233 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:50,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:50,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:50,342 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,351 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,358 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:50,377 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:07:50,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,410 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-31 17:07:50,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,422 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-31 17:07:50,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:50,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:07:50,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,456 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-31 17:07:50,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-31 17:07:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:50,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:50,486 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-31 17:07:50,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:50,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:50,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:50,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:50,508 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-31 17:07:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:51,223 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-31 17:07:51,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:51,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:51,226 INFO L225 Difference]: With dead ends: 175 [2019-01-31 17:07:51,226 INFO L226 Difference]: Without dead ends: 174 [2019-01-31 17:07:51,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-31 17:07:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-31 17:07:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-31 17:07:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-31 17:07:51,630 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-31 17:07:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:51,630 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-31 17:07:51,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-31 17:07:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:51,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:51,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:51,632 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:51,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:51,632 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-31 17:07:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:51,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:51,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:51,803 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:07:52,131 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-31 17:07:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:52,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:52,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:07:52,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:52,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:07:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:07:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:07:52,240 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-31 17:07:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:52,620 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-31 17:07:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:52,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-31 17:07:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:52,622 INFO L225 Difference]: With dead ends: 185 [2019-01-31 17:07:52,622 INFO L226 Difference]: Without dead ends: 184 [2019-01-31 17:07:52,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:07:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-31 17:07:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-31 17:07:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-31 17:07:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-31 17:07:52,849 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-31 17:07:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:52,849 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-31 17:07:52,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:07:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-31 17:07:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:52,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:52,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:52,850 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-31 17:07:52,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:52,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:52,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:52,921 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-31 17:07:52,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:52,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:52,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:52,922 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-31 17:07:52,923 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:52,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:52,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:52,926 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:52,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:52,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:52,926 INFO 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-31 17:07:52,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:52,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:52,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:52,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:52,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:52,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:53,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:53,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:53,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:53,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:53,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:07:53,049 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,065 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,077 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,097 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:53,117 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:07:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,149 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-31 17:07:53,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,160 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-31 17:07:53,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:53,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,179 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:53,180 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-31 17:07:53,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,191 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-31 17:07:53,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:53,203 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-31 17:07:53,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:53,221 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-31 17:07:53,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:53,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:53,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:53,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:53,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:53,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:53,241 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-31 17:07:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:53,705 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-31 17:07:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:53,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:53,708 INFO L225 Difference]: With dead ends: 142 [2019-01-31 17:07:53,708 INFO L226 Difference]: Without dead ends: 141 [2019-01-31 17:07:53,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-31 17:07:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-31 17:07:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-31 17:07:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-31 17:07:53,947 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-31 17:07:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:53,947 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-31 17:07:53,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-31 17:07:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:53,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:53,947 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:07:53,948 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:53,948 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-31 17:07:53,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:53,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:53,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:53,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:54,000 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-31 17:07:54,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:54,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:54,000 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:54,001 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-31 17:07:54,001 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:54,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:54,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:54,006 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:54,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:54,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:54,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:54,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:54,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:54,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:54,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:54,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:54,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:54,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:54,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:54,068 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:54,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:07:54,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:54,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:54,266 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,280 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,293 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,308 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:54,335 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:54,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:54,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:54,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:54,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-31 17:07:54,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,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, 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-31 17:07:54,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,510 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-31 17:07:54,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-31 17:07:54,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,538 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-31 17:07:54,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,563 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-31 17:07:54,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:54,580 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-31 17:07:54,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:54,603 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-31 17:07:54,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:54,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 17:07:54,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:54,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:54,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:54,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:54,622 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-31 17:07:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:55,341 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-31 17:07:55,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:55,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:07:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:55,344 INFO L225 Difference]: With dead ends: 219 [2019-01-31 17:07:55,344 INFO L226 Difference]: Without dead ends: 216 [2019-01-31 17:07:55,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-31 17:07:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-31 17:07:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-31 17:07:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-31 17:07:55,673 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-31 17:07:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:55,673 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-31 17:07:55,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-31 17:07:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:55,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:55,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:55,674 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-31 17:07:55,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:55,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:55,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:55,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:55,795 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-31 17:07:55,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:55,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:55,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:55,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:55,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:55,796 INFO 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-31 17:07:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:07:55,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:07:55,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:07:55,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:55,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:55,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:55,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:55,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:55,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:55,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:55,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:55,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:55,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:55,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:55,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:55,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:55,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:55,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:55,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:07:55,940 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,971 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,982 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,992 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:56,013 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:07:56,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-31 17:07:56,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:56,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:56,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-31 17:07:56,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-01-31 17:07:56,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:56,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-31 17:07:56,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-31 17:07:56,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-31 17:07:56,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:56,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-31 17:07:56,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-31 17:07:56,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:56,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-31 17:07:56,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-31 17:07:56,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-31 17:07:56,894 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-31 17:07:56,993 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-31 17:07:56,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:57,044 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-31 17:07:57,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:57,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:57,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:57,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:57,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:57,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:57,066 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-31 17:07:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:58,255 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-31 17:07:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:58,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:58,258 INFO L225 Difference]: With dead ends: 218 [2019-01-31 17:07:58,258 INFO L226 Difference]: Without dead ends: 215 [2019-01-31 17:07:58,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-31 17:07:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-31 17:07:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-31 17:07:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-31 17:07:58,602 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-31 17:07:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:58,602 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-31 17:07:58,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-31 17:07:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:58,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:58,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:58,603 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:58,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:58,603 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-31 17:07:58,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:58,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:58,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:58,661 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-31 17:07:58,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:58,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:58,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:58,662 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-31 17:07:58,663 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:58,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:58,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:58,664 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:58,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:58,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:58,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:58,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:58,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:58,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:58,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:58,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,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 36 treesize of output 49 [2019-01-31 17:07:58,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:07:58,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:58,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:07:58,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:58,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:58,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:58,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:58,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:58,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:58,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:07:58,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:07:58,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:07:58,870 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,080 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,093 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,102 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:59,139 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:07:59,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:07:59,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,190 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-31 17:07:59,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:59,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-31 17:07:59,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:59,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-31 17:07:59,262 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-31 17:07:59,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:59,273 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-31 17:07:59,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:59,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:59,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:59,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:59,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:59,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:59,294 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-31 17:08:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:00,100 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-31 17:08:00,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:00,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:08:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:00,103 INFO L225 Difference]: With dead ends: 274 [2019-01-31 17:08:00,103 INFO L226 Difference]: Without dead ends: 269 [2019-01-31 17:08:00,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-31 17:08:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-31 17:08:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-31 17:08:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-31 17:08:00,606 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-31 17:08:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:00,606 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-31 17:08:00,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-31 17:08:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:08:00,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:00,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:08:00,608 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:00,608 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-31 17:08:00,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:00,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:00,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:00,745 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-31 17:08:00,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:00,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:00,745 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:08:00,746 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-31 17:08:00,746 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:00,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:00,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:00,749 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:00,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:00,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:00,749 INFO 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-31 17:08:00,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:00,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:00,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:00,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 18 treesize of output 21 [2019-01-31 17:08:00,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:08:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:08:00,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:08:00,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:08:00,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:00,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:00,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:00,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:00,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:00,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:08:00,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:08:00,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:08:00,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:08:01,004 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,030 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,045 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:01,072 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:08:01,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:08:01,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:01,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:08:01,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:08:01,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:08:01,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:08:01,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-31 17:08:01,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,331 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:01,332 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-31 17:08:01,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,354 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-31 17:08:01,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-31 17:08:01,371 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-31 17:08:01,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:01,389 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-31 17:08:01,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:01,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-31 17:08:01,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:01,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:01,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:01,409 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-31 17:08:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:03,014 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-31 17:08:03,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:08:03,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:08:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:03,018 INFO L225 Difference]: With dead ends: 480 [2019-01-31 17:08:03,018 INFO L226 Difference]: Without dead ends: 477 [2019-01-31 17:08:03,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-31 17:08:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-31 17:08:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-31 17:08:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-31 17:08:03,908 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-31 17:08:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:03,909 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-31 17:08:03,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-31 17:08:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:03,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:03,910 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:08:03,910 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-31 17:08:03,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:03,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:03,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:03,948 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-31 17:08:03,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:03,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:03,949 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:03,949 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-31 17:08:03,950 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:03,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:03,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:03,952 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:08:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:03,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:03,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:03,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:08:03,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:03,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:03,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:03,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:08:03,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:08:03,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-31 17:08:04,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-31 17:08:04,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-31 17:08:04,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:04,063 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-31 17:08:04,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:08:04,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:08:04,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,075 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-31 17:08:04,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-31 17:08:04,082 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-31 17:08:04,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:04,087 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-31 17:08:04,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:08:04,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-31 17:08:04,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:08:04,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:08:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:08:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:04,106 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-31 17:08:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:06,058 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-31 17:08:06,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:08:06,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 17:08:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:06,064 INFO L225 Difference]: With dead ends: 804 [2019-01-31 17:08:06,065 INFO L226 Difference]: Without dead ends: 800 [2019-01-31 17:08:06,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-31 17:08:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-31 17:08:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-31 17:08:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-31 17:08:08,123 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-31 17:08:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:08,123 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-31 17:08:08,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:08:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-31 17:08:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:08,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:08,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:08,126 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:08,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:08,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-31 17:08:08,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:08,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:08,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:08,288 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-31 17:08:08,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:08,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:08,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:08,289 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-31 17:08:08,290 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:08,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:08,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:08,292 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:08:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:08,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:08,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:08,293 INFO 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-31 17:08:08,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:08,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:08,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:08,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:08:08,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:08:08,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:08:08,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:08:08,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:08:08,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:08:08,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:08:08,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:08:08,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:08:08,606 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,622 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,636 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,652 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,680 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-31 17:08:08,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:08:08,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,743 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-31 17:08:08,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:08:08,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:08:08,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,810 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-31 17:08:08,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:08:08,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,849 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:08,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-31 17:08:08,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,884 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-31 17:08:08,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-31 17:08:08,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:08,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:08:08,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:08,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:08:09,009 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-31 17:08:09,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:09,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:09,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:08:09,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:09,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:09,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:09,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:09,088 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-31 17:08:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:21,810 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-31 17:08:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:21,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:21,816 INFO L225 Difference]: With dead ends: 821 [2019-01-31 17:08:21,817 INFO L226 Difference]: Without dead ends: 820 [2019-01-31 17:08:21,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=145, Invalid=274, Unknown=1, NotChecked=0, Total=420 [2019-01-31 17:08:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-31 17:08:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-31 17:08:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-31 17:08:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-31 17:08:23,833 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-31 17:08:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:23,833 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-31 17:08:23,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-31 17:08:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:23,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:23,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:23,836 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-31 17:08:23,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:23,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:23,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:23,886 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-31 17:08:23,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:23,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:23,886 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:23,887 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-31 17:08:23,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:23,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:23,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:23,889 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:23,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:23,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:23,890 INFO 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-31 17:08:23,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:23,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:23,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:23,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-31 17:08:23,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:08:23,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-31 17:08:23,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-31 17:08:23,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:08:24,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:08:24,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-31 17:08:24,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-31 17:08:24,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:08:24,022 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,037 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,047 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,066 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:24,084 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-31 17:08:24,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,107 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-31 17:08:24,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:08:24,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,127 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-31 17:08:24,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,136 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-31 17:08:24,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-31 17:08:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:24,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:24,169 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-31 17:08:24,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:24,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:24,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:24,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:24,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:24,189 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-31 17:08:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:26,311 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-31 17:08:26,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:26,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:08:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:26,317 INFO L225 Difference]: With dead ends: 805 [2019-01-31 17:08:26,317 INFO L226 Difference]: Without dead ends: 804 [2019-01-31 17:08:26,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-31 17:08:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-31 17:08:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-31 17:08:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-31 17:08:28,437 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-31 17:08:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:28,437 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-31 17:08:28,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-31 17:08:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:28,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:28,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:28,439 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-31 17:08:28,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:28,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:28,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:28,561 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-31 17:08:28,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:28,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:28,562 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:28,562 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-31 17:08:28,563 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:28,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:28,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:28,565 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:28,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:28,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:28,566 INFO 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-31 17:08:28,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:28,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:28,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:28,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:08:28,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:08:28,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:08:28,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:08:28,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:08:28,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:08:28,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:08:28,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:08:28,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:08:28,831 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,846 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,861 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,877 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:28,906 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:08:28,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,954 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-31 17:08:28,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:28,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:08:28,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,006 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-31 17:08:29,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,027 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-31 17:08:29,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:08:29,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,058 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:29,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:29,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,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-31 17:08:29,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:08:29,104 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-31 17:08:29,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:29,151 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-31 17:08:29,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:08:29,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:29,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:08:29,171 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-31 17:08:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:32,095 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-31 17:08:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:32,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:32,107 INFO L225 Difference]: With dead ends: 1004 [2019-01-31 17:08:32,107 INFO L226 Difference]: Without dead ends: 1003 [2019-01-31 17:08:32,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-31 17:08:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-31 17:08:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-31 17:08:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-31 17:08:34,382 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-31 17:08:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:34,382 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-31 17:08:34,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-31 17:08:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:34,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:34,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:34,385 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-31 17:08:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:34,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:34,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:34,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:34,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:34,569 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-31 17:08:34,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:34,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:34,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:34,570 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-31 17:08:34,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:34,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:34,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:34,574 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:34,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:34,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:34,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 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-31 17:08:34,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:34,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:34,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:34,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:08:34,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:08:34,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:08:34,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,662 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:08:34,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:08:34,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:08:34,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:08:34,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:08:34,701 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,716 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,728 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:34,769 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:08:34,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-31 17:08:34,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,816 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-31 17:08:34,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-31 17:08:34,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:08:34,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:08:34,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:08:34,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-31 17:08:34,954 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-31 17:08:34,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:34,968 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-31 17:08:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:34,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:08:34,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:34,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:08:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:08:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:34,988 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-31 17:08:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:38,349 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-31 17:08:38,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:38,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:08:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:38,359 INFO L225 Difference]: With dead ends: 1213 [2019-01-31 17:08:38,359 INFO L226 Difference]: Without dead ends: 1212 [2019-01-31 17:08:38,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-31 17:08:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-31 17:08:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-31 17:08:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-31 17:08:41,341 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-31 17:08:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:41,342 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-31 17:08:41,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:08:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-31 17:08:41,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:41,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:41,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:41,344 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:41,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-31 17:08:41,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:41,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:41,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:41,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:41,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:41,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:41,489 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:41,489 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-31 17:08:41,490 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:41,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:41,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:41,492 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:08:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:41,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:41,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:41,493 INFO 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-31 17:08:41,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:41,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:41,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:41,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:08:41,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:08:41,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:08:41,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:08:41,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:08:41,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,594 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:08:41,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:08:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:08:41,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:08:41,789 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,803 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,836 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:41,867 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:08:41,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:08:41,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:41,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:08:41,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,993 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:41,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-31 17:08:41,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,027 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-31 17:08:42,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-31 17:08:42,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-31 17:08:42,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,091 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-31 17:08:42,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-31 17:08:42,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:42,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-31 17:08:42,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:42,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:42,193 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-31 17:08:42,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:42,238 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-31 17:08:42,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:42,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:08:42,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:42,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:42,257 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-31 17:08:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:46,799 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-31 17:08:46,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:08:46,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:46,814 INFO L225 Difference]: With dead ends: 1577 [2019-01-31 17:08:46,814 INFO L226 Difference]: Without dead ends: 1575 [2019-01-31 17:08:46,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:08:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-31 17:08:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-31 17:08:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-31 17:08:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-31 17:08:48,892 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-31 17:08:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:48,892 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-31 17:08:48,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-31 17:08:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:48,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:48,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:48,894 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-31 17:08:48,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:48,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:48,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:49,052 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-31 17:08:49,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:49,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:49,052 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:49,052 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-31 17:08:49,053 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:49,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:49,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:49,055 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:08:49,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:49,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:49,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:49,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:08:49,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:49,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:49,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:49,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:08:49,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:08:49,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:08:49,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:08:49,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:08:49,107 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:08:49,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:08:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:08:49,249 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,269 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:49,291 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:08:49,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,338 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-31 17:08:49,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,355 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-31 17:08:49,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:08:49,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,380 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:49,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, 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-31 17:08:49,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,402 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-31 17:08:49,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-31 17:08:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,430 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-31 17:08:49,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,451 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-31 17:08:49,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:08:49,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:49,480 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:49,481 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-31 17:08:49,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:49,506 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-31 17:08:49,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:08:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:49,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:49,572 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-31 17:08:49,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:49,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:08:49,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:49,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:08:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:08:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:08:49,593 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-31 17:08:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:53,063 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-31 17:08:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:53,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:08:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:53,070 INFO L225 Difference]: With dead ends: 1108 [2019-01-31 17:08:53,070 INFO L226 Difference]: Without dead ends: 1107 [2019-01-31 17:08:53,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:08:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-31 17:08:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-31 17:08:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-31 17:08:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-31 17:08:56,044 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-31 17:08:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:56,045 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-31 17:08:56,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:08:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-31 17:08:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:56,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:56,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:56,047 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-31 17:08:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:56,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:56,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:56,438 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-01-31 17:08:56,566 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-31 17:08:56,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:56,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:56,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:56,567 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-31 17:08:56,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:56,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:56,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:56,571 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:56,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:56,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:56,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:56,571 INFO 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-31 17:08:56,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:56,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:56,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:56,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 18 treesize of output 21 [2019-01-31 17:08:56,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:08:56,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:08:56,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:08:56,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:08:56,633 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,659 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:08:56,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:08:56,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:08:56,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:08:56,817 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,832 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,864 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:56,894 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:08:56,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:08:56,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:56,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:56,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:08:56,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:56,977 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:56,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:08:56,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:08:57,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:08:57,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:08:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:57,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:57,136 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-31 17:08:57,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:57,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:57,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:57,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:57,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:57,156 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-31 17:09:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:00,277 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-31 17:09:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:09:00,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:09:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:00,282 INFO L225 Difference]: With dead ends: 1075 [2019-01-31 17:09:00,282 INFO L226 Difference]: Without dead ends: 1074 [2019-01-31 17:09:00,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-31 17:09:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-31 17:09:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-31 17:09:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-31 17:09:03,214 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-31 17:09:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:03,214 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-31 17:09:03,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-31 17:09:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:09:03,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:03,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:03,217 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-31 17:09:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:03,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:03,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:03,319 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-31 17:09:03,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:03,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:03,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:09:03,319 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-31 17:09:03,320 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:03,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:03,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:03,323 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:09:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:03,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:03,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:03,324 INFO 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-31 17:09:03,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:03,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:03,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:09:03,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:09:03,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:09:03,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:09:03,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:09:03,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:09:03,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:09:03,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:09:03,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:09:03,649 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,666 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,682 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,699 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:03,730 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:09:03,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:09:03,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:03,792 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-31 17:09:03,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:09:03,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:03,970 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:03,970 INFO L303 Elim1Store]: Index analysis took 154 ms [2019-01-31 17:09:03,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:09:03,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:04,001 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-31 17:09:04,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-31 17:09:04,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:09:04,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:04,077 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-31 17:09:04,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-31 17:09:04,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:04,116 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:04,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:09:04,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:04,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:04,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:09:04,174 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-31 17:09:04,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:04,224 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-31 17:09:04,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:04,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:09:04,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:04,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:04,244 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-31 17:09:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:09,011 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-31 17:09:09,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:09:09,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:09:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:09,019 INFO L225 Difference]: With dead ends: 1522 [2019-01-31 17:09:09,019 INFO L226 Difference]: Without dead ends: 1521 [2019-01-31 17:09:09,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:09:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-31 17:09:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-31 17:09:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-31 17:09:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-31 17:09:12,273 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-31 17:09:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:12,273 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-31 17:09:12,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:09:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-31 17:09:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:09:12,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:12,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:12,276 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-31 17:09:12,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:12,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:12,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:12,311 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-31 17:09:12,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:12,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:12,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:09:12,312 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-31 17:09:12,312 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:12,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:12,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:12,315 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:09:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:12,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:12,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:12,315 INFO 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-31 17:09:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:12,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:12,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:12,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:09:12,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:09:12,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-31 17:09:12,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-31 17:09:12,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-31 17:09:12,364 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,373 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:12,416 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-31 17:09:12,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:09:12,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:09:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:12,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:12,448 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-31 17:09:12,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:09:12,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:09:12,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:09:12,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:09:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:09:12,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:09:12,468 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-31 17:09:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:16,667 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-31 17:09:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:09:16,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-31 17:09:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:16,674 INFO L225 Difference]: With dead ends: 1559 [2019-01-31 17:09:16,674 INFO L226 Difference]: Without dead ends: 1554 [2019-01-31 17:09:16,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:09:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-31 17:09:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-31 17:09:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-31 17:09:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-31 17:09:21,113 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-31 17:09:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:21,113 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-31 17:09:21,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:09:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-31 17:09:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:09:21,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:21,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:21,116 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-31 17:09:21,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:21,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:21,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:21,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:21,259 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-31 17:09:21,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:21,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:21,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:09:21,260 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-31 17:09:21,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:21,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:21,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:21,263 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:09:21,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:21,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:21,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:21,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:21,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:21,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:21,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:21,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:09:21,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:09:21,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:09:21,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:09:21,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:09:21,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:09:21,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:09:21,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:09:21,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:09:21,492 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,515 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,530 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,546 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:21,576 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:09:21,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:09:21,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,632 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-31 17:09:21,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:09:21,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:09:21,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:21,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:09:21,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:09:21,815 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-31 17:09:21,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:21,830 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-31 17:09:21,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:21,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:09:21,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:21,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:09:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:09:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:09:21,849 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-31 17:09:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:26,323 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-31 17:09:26,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:26,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:09:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:26,330 INFO L225 Difference]: With dead ends: 1574 [2019-01-31 17:09:26,330 INFO L226 Difference]: Without dead ends: 1570 [2019-01-31 17:09:26,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-31 17:09:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-31 17:09:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-31 17:09:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-31 17:09:30,789 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-31 17:09:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:30,789 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-31 17:09:30,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-31 17:09:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:09:30,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:30,791 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:09:30,792 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-31 17:09:30,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:30,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:30,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:30,854 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-31 17:09:30,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:30,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:30,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:30,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:30,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:30,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:30,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:09:30,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:09:30,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:09:30,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:30,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:30,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:09:30,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:09:30,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:09:30,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:09:30,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:09:30,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,932 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:09:30,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:09:31,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:09:31,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:09:31,080 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,095 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,108 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,124 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:31,151 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:09:31,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:09:31,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,202 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-31 17:09:31,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:09:31,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:09:31,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:31,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:09:31,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-31 17:09:31,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,392 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:31,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:09:31,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,420 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-31 17:09:31,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-31 17:09:31,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:31,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,477 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-31 17:09:31,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:09:31,496 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-31 17:09:31,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:31,546 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-31 17:09:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:31,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:09:31,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:31,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:31,566 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-31 17:09:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:37,718 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-31 17:09:37,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:37,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:09:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:37,727 INFO L225 Difference]: With dead ends: 2098 [2019-01-31 17:09:37,727 INFO L226 Difference]: Without dead ends: 2091 [2019-01-31 17:09:37,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:09:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-31 17:09:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-31 17:09:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-31 17:09:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-31 17:09:43,079 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-31 17:09:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:43,079 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-31 17:09:43,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-31 17:09:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:09:43,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:43,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:43,082 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-31 17:09:43,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:43,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:43,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:43,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:43,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:43,134 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-31 17:09:43,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:43,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:43,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:09:43,135 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-31 17:09:43,135 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:43,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:43,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:43,137 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:09:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:43,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:43,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:43,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:43,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:43,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:43,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:43,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 18 treesize of output 21 [2019-01-31 17:09:43,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:09:43,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:09:43,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:09:43,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:09:43,288 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:09:43,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:09:43,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:09:43,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:09:43,465 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,479 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,492 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,507 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:43,536 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:09:43,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:09:43,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,589 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-31 17:09:43,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:09:43,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,638 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:43,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:43,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,658 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-31 17:09:43,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:09:43,919 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-31 17:09:43,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:43,995 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-31 17:09:44,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:44,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:09:44,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:44,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:09:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:09:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:44,015 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-31 17:09:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:49,263 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-31 17:09:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:09:49,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:09:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:49,268 INFO L225 Difference]: With dead ends: 1846 [2019-01-31 17:09:49,268 INFO L226 Difference]: Without dead ends: 1839 [2019-01-31 17:09:49,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-31 17:09:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-31 17:09:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-31 17:09:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-31 17:09:54,616 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-31 17:09:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:54,616 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-31 17:09:54,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-31 17:09:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:09:54,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:54,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:54,619 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-31 17:09:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:54,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:54,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:54,768 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-31 17:09:54,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:54,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:54,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:09:54,769 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-31 17:09:54,770 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:54,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:54,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:54,772 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:09:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:54,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:54,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:54,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:54,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:54,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:54,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:09:54,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:09:54,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:09:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:09:54,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,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 27 treesize of output 62 [2019-01-31 17:09:54,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,882 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:09:54,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:09:54,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:09:55,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:09:55,013 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,028 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,042 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:55,085 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:09:55,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:09:55,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:55,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:09:55,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-31 17:09:55,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-01-31 17:09:55,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-01-31 17:09:55,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:09:55,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-31 17:09:55,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:55,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-31 17:09:55,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:55,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:55,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-31 17:09:55,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:55,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:09:55,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-31 17:09:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:55,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:55,692 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-31 17:09:55,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:55,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:09:55,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:55,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:55,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:55,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:55,711 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-31 17:09:57,413 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-31 17:10:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:02,656 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-31 17:10:02,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:10:02,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:10:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:02,662 INFO L225 Difference]: With dead ends: 2193 [2019-01-31 17:10:02,662 INFO L226 Difference]: Without dead ends: 2192 [2019-01-31 17:10:02,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:10:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-31 17:10:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-31 17:10:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-31 17:10:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-31 17:10:08,429 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-31 17:10:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:08,429 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-31 17:10:08,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:10:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-31 17:10:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:10:08,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:08,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:08,432 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:08,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:08,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-31 17:10:08,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:08,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:08,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:08,579 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:10:08,740 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-31 17:10:08,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:08,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:08,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:10:08,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:10:08,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:08,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:08,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:10:08,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:10:08,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:10:08,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:10:08,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:08,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:10:08,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:10:08,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:10:08,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:08,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:10:08,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:08,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:08,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:08,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:08,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:10:09,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:10:09,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:10:09,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:10:09,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:10:09,053 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,140 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,154 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,165 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:09,206 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:10:09,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:10:09,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,272 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-31 17:10:09,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:10:09,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:10:09,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,365 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-31 17:10:09,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-31 17:10:09,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,400 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:09,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:10:09,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,437 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-31 17:10:09,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-31 17:10:09,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,479 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:09,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:10:09,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:09,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:10:09,568 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-31 17:10:09,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:09,622 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-31 17:10:09,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:09,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:10:09,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:09,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:10:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:10:09,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:09,642 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-31 17:10:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:17,151 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-31 17:10:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:10:17,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:10:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:17,158 INFO L225 Difference]: With dead ends: 2526 [2019-01-31 17:10:17,158 INFO L226 Difference]: Without dead ends: 2520 [2019-01-31 17:10:17,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:10:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-31 17:10:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-31 17:10:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-31 17:10:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-31 17:10:23,044 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-31 17:10:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:23,045 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-31 17:10:23,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:10:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-31 17:10:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:10:23,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:23,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:23,049 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-31 17:10:23,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:23,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:23,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:10:23,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:23,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:23,180 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-31 17:10:23,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:23,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:23,181 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:10:23,181 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-31 17:10:23,182 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:23,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:23,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:23,185 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:10:23,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:23,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:23,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:23,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:23,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:23,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:23,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:23,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:10:23,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:10:23,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:10:23,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:10:23,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:10:23,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:10:23,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:10:23,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:10:23,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:10:23,419 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,433 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,463 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:23,491 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:10:23,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:10:23,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:10:23,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:10:23,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-31 17:10:23,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:23,746 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:23,746 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-31 17:10:23,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:23,766 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-31 17:10:23,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-31 17:10:23,784 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-31 17:10:23,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:23,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:23,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-31 17:10:23,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:23,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:10:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:10:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:10:23,826 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-31 17:10:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:29,633 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-31 17:10:29,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:29,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:10:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:29,638 INFO L225 Difference]: With dead ends: 1971 [2019-01-31 17:10:29,639 INFO L226 Difference]: Without dead ends: 1964 [2019-01-31 17:10:29,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:10:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-31 17:10:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-31 17:10:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-31 17:10:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-31 17:10:35,555 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-31 17:10:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:35,556 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-31 17:10:35,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:10:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-31 17:10:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:10:35,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:35,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:35,561 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-31 17:10:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:35,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:35,676 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-31 17:10:35,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:35,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:35,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:10:35,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:10:35,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:35,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:35,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:10:35,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:10:35,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:10:35,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:10:35,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:35,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 18 treesize of output 21 [2019-01-31 17:10:35,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:10:35,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:10:35,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:10:35,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:10:35,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:10:35,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:10:35,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:10:35,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:35,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:10:35,904 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,918 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,932 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,948 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:35,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:35,977 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:10:36,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,021 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-31 17:10:36,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:36,041 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-31 17:10:36,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:10:36,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,069 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-31 17:10:36,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:36,091 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-31 17:10:36,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:10:36,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:36,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:36,122 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-31 17:10:36,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:36,146 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-31 17:10:36,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:10:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:36,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:36,202 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-31 17:10:36,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:36,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:10:36,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:36,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:10:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:10:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:10:36,220 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-31 17:10:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:42,357 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-31 17:10:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:42,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:10:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:42,362 INFO L225 Difference]: With dead ends: 2036 [2019-01-31 17:10:42,363 INFO L226 Difference]: Without dead ends: 2033 [2019-01-31 17:10:42,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-31 17:10:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-31 17:10:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-31 17:10:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-31 17:10:48,508 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-31 17:10:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:48,508 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-31 17:10:48,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:10:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-31 17:10:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:10:48,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:48,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:48,512 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-31 17:10:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:48,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:10:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:48,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:48,584 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-31 17:10:48,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:48,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:48,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:10:48,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:10:48,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:48,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:48,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:10:48,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:10:48,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:10:48,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:10:48,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:10:48,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:10:48,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:10:48,691 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:10:48,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:10:48,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:10:48,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:10:48,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:10:48,762 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,780 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:48,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:48,835 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:10:48,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-31 17:10:48,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:10:48,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-31 17:10:48,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-31 17:10:48,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:48,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-31 17:10:49,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:10:49,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:49,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-31 17:10:49,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-31 17:10:49,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-31 17:10:49,418 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-31 17:10:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-01-31 17:10:49,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-31 17:10:49,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,609 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:49,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-31 17:10:49,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:49,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-01-31 17:10:49,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-31 17:10:49,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-31 17:10:49,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,833 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:49,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-01-31 17:10:49,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-31 17:10:49,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:50,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:50,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-31 17:10:50,015 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:50,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:50,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-01-31 17:10:50,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:50,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-31 17:10:50,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-31 17:10:53,977 WARN L181 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-31 17:10:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:53,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:54,103 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-31 17:10:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:10:54,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:54,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:10:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:10:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:54,128 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-31 17:11:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:03,735 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-31 17:11:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:11:03,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:11:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:03,743 INFO L225 Difference]: With dead ends: 2952 [2019-01-31 17:11:03,743 INFO L226 Difference]: Without dead ends: 2951 [2019-01-31 17:11:03,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:11:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-31 17:11:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-31 17:11:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-31 17:11:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-31 17:11:09,174 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-31 17:11:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:09,175 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-31 17:11:09,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:11:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-31 17:11:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:11:09,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:09,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:09,177 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-31 17:11:09,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:09,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:09,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:09,334 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-31 17:11:09,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:09,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:09,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:11:09,335 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-31 17:11:09,335 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:09,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:09,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:09,337 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:11:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:09,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:09,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:09,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:09,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:09,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:09,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:09,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:11:09,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:11:09,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:11:09,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:11:09,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:11:09,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:11:09,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:11:09,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:11:09,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:11:09,542 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,565 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,578 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,588 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,598 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:09,626 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:11:09,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:11:09,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:09,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:11:09,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-31 17:11:09,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,827 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:09,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-01-31 17:11:09,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:09,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-31 17:11:09,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:09,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:11:09,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-31 17:11:10,022 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-31 17:11:10,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:10,049 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-31 17:11:10,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:10,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-31 17:11:10,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:10,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:11:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:11:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:11:10,069 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-31 17:11:10,332 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-31 17:11:10,501 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-31 17:11:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:16,581 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-31 17:11:16,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:16,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:11:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:16,587 INFO L225 Difference]: With dead ends: 1903 [2019-01-31 17:11:16,587 INFO L226 Difference]: Without dead ends: 1896 [2019-01-31 17:11:16,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-31 17:11:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-31 17:11:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-31 17:11:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-31 17:11:22,589 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-31 17:11:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:22,589 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-31 17:11:22,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:11:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-31 17:11:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:11:22,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:22,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:22,592 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-31 17:11:22,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:22,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:22,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:22,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:22,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:22,671 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-31 17:11:22,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:22,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:22,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:22,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:22,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:22,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:22,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:11:22,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:11:22,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:11:22,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:22,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:22,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:11:22,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:11:22,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:11:22,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:11:22,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:11:22,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:11:22,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:11:22,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:11:22,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:11:22,908 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,923 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,938 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,954 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:22,981 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:11:23,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:11:23,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,032 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-31 17:11:23,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:11:23,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,060 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:23,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:11:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:23,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:11:23,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:11:23,193 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-31 17:11:23,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:23,213 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-31 17:11:23,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:23,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:11:23,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:23,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:11:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:11:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:11:23,233 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-31 17:11:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:29,049 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-31 17:11:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:11:29,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:11:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:29,054 INFO L225 Difference]: With dead ends: 1884 [2019-01-31 17:11:29,054 INFO L226 Difference]: Without dead ends: 1877 [2019-01-31 17:11:29,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:11:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-31 17:11:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-31 17:11:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-31 17:11:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-31 17:11:35,131 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-31 17:11:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:35,131 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-31 17:11:35,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:11:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-31 17:11:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:11:35,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:35,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:35,134 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-31 17:11:35,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:35,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:35,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:35,248 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-31 17:11:35,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:35,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:35,249 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:11:35,249 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-31 17:11:35,250 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:35,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:35,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:35,252 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:11:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:35,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:35,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:35,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:35,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:35,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:35,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:35,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:11:35,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:11:35,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:11:35,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:11:35,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:11:35,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:11:35,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:11:35,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:11:35,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:11:35,509 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,531 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,722 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,783 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:35,820 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:11:35,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:11:35,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,870 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-31 17:11:35,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:11:35,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-31 17:11:35,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,924 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-31 17:11:35,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-31 17:11:35,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,957 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:35,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-01-31 17:11:35,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:36,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:11:36,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-31 17:11:36,115 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-31 17:11:36,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:36,145 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-31 17:11:36,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:36,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:11:36,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:36,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:11:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:11:36,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:11:36,164 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-31 17:11:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:45,391 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-31 17:11:45,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:11:45,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:11:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:45,399 INFO L225 Difference]: With dead ends: 2991 [2019-01-31 17:11:45,400 INFO L226 Difference]: Without dead ends: 2978 [2019-01-31 17:11:45,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:11:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-31 17:11:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-31 17:11:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-31 17:11:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-31 17:11:53,212 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-31 17:11:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:53,212 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-31 17:11:53,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:11:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-31 17:11:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:11:53,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:53,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:53,216 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-31 17:11:53,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:53,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:53,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:53,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:53,321 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-31 17:11:53,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:53,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:53,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:11:53,321 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-31 17:11:53,323 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:53,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:53,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:53,325 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:11:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:53,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:53,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:53,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:53,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:53,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:53,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:53,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:11:53,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:11:53,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:11:53,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:11:53,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,527 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:11:53,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:11:53,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:11:53,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:11:53,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:11:53,580 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,605 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,629 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,671 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-31 17:11:53,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:11:53,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,741 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-31 17:11:53,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:11:53,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:11:53,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:53,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:11:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,854 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:53,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-31 17:11:53,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,890 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-31 17:11:53,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-31 17:11:53,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:53,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-31 17:11:53,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:53,967 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-31 17:11:53,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-31 17:11:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:53,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:54,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:54,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:54,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:54,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:54,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:54,005 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:54,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-31 17:11:54,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:54,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:54,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-31 17:11:54,075 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-31 17:11:54,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:54,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:54,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:11:54,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:54,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:11:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:11:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:54,323 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-31 17:12:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:05,209 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-31 17:12:05,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:12:05,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-31 17:12:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:05,218 INFO L225 Difference]: With dead ends: 3181 [2019-01-31 17:12:05,218 INFO L226 Difference]: Without dead ends: 3179 [2019-01-31 17:12:05,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:12:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-31 17:12:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-31 17:12:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-31 17:12:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-31 17:12:13,094 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-31 17:12:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:13,094 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-31 17:12:13,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:12:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-31 17:12:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:12:13,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:13,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:12:13,098 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-31 17:12:13,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:13,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:12:13,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:12:13,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:12:13,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:12:13,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:12:13,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:12:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:12:13,174 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-31 17:12:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:20,531 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-31 17:12:20,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:12:20,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 17:12:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:20,538 INFO L225 Difference]: With dead ends: 2346 [2019-01-31 17:12:20,538 INFO L226 Difference]: Without dead ends: 2337 [2019-01-31 17:12:20,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:12:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-31 17:12:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-31 17:12:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-31 17:12:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-31 17:12:28,275 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-31 17:12:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:28,275 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-31 17:12:28,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:12:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-31 17:12:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:12:28,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:28,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:12:28,279 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-31 17:12:28,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:28,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:28,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:28,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:28,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:28,460 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-31 17:12:28,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:28,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:12:28,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:12:28,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:12:28,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:28,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:12:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:12:28,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:12:28,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:12:28,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:12:28,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:12:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:12:28,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:12:28,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:12:28,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:12:28,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:12:28,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:12:28,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:12:28,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:12:28,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:12:28,721 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,744 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,759 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,770 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,811 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-31 17:12:28,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:12:28,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,878 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-31 17:12:28,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:12:28,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:28,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:12:28,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:28,950 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-31 17:12:28,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:12:29,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,218 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:12:29,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,239 INFO L303 Elim1Store]: Index analysis took 262 ms [2019-01-31 17:12:29,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:12:29,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:29,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:29,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-31 17:12:29,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,320 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:12:29,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-31 17:12:29,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:29,358 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-31 17:12:29,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:12:29,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:29,398 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:12:29,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-31 17:12:29,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:29,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:29,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-31 17:12:29,462 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-31 17:12:29,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:12:29,549 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-31 17:12:29,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:12:29,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:12:29,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:12:29,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:12:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:12:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:12:29,569 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-31 17:12:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:37,821 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-31 17:12:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:12:37,822 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-31 17:12:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:37,828 INFO L225 Difference]: With dead ends: 2345 [2019-01-31 17:12:37,828 INFO L226 Difference]: Without dead ends: 2338 [2019-01-31 17:12:37,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:12:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-31 17:12:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-31 17:12:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-31 17:12:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-31 17:12:39,986 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-31 17:12:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:39,986 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-31 17:12:39,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:12:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-31 17:12:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:12:39,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:39,987 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:12:39,987 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-31 17:12:39,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:39,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:12:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:39,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:40,047 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-31 17:12:40,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:40,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:12:40,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:12:40,048 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-31 17:12:40,049 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:12:40,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:12:40,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:12:40,051 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:12:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:40,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:12:40,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:40,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:12:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:40,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:12:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:40,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:12:40,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:12:40,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:12:40,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:12:40,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:12:40,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:12:40,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,121 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:12:40,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:12:40,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:12:40,305 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,316 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,325 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:40,343 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:12:40,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,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, 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-31 17:12:40,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-31 17:12:40,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,400 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-31 17:12:40,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-31 17:12:40,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-31 17:12:40,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:40,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-31 17:12:40,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:40,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-31 17:12:40,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:40,489 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-31 17:12:40,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-31 17:12:40,505 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-31 17:12:40,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:12:40,542 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-31 17:12:40,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:12:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:12:40,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:12:40,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:12:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:12:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:12:40,562 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-31 17:12:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:42,918 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-31 17:12:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:12:42,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:12:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:42,920 INFO L225 Difference]: With dead ends: 480 [2019-01-31 17:12:42,921 INFO L226 Difference]: Without dead ends: 477 [2019-01-31 17:12:42,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:12:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-31 17:12:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-31 17:12:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-31 17:12:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-31 17:12:43,860 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-31 17:12:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:43,860 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-31 17:12:43,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:12:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-31 17:12:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:12:43,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:43,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:12:43,861 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:43,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-31 17:12:43,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:43,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:43,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:43,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:43,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:43,917 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-31 17:12:43,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:43,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:12:43,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:12:43,918 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:12:43,918 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:12:43,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:12:43,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:12:43,920 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:12:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:43,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:12:43,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:43,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:12:43,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:43,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:12:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:43,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:12:43,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:12:43,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:12:43,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:12:43,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:12:43,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:43,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:12:43,963 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:43,988 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:12:44,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:12:44,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:12:44,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:12:44,132 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,159 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,174 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:44,201 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:12:44,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,235 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-31 17:12:44,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,251 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-31 17:12:44,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:12:44,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,276 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-31 17:12:44,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,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-31 17:12:44,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:12:44,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:44,322 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:12:44,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-31 17:12:44,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:44,344 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-31 17:12:44,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:12:44,361 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-31 17:12:44,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:12:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:12:44,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:12:44,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:12:44,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:12:44,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:12:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:12:44,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:12:44,412 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-31 17:12:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:46,283 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-31 17:12:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:12:46,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:12:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:46,285 INFO L225 Difference]: With dead ends: 250 [2019-01-31 17:12:46,285 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 17:12:46,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:12:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 17:12:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-31 17:12:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-31 17:12:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-31 17:12:47,815 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-31 17:12:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:47,815 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-31 17:12:47,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:12:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-31 17:12:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:12:47,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:47,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:12:47,816 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-31 17:12:47,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:47,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:47,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:47,911 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-31 17:12:47,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:47,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:12:47,912 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:12:47,912 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-31 17:12:47,912 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:12:47,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:12:47,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:12:47,914 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:12:47,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:47,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:12:47,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:47,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:12:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:47,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:12:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:47,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:12:47,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:12:47,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:12:47,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:47,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:47,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:12:47,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:47,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:47,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:47,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:12:47,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-31 17:12:47,961 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:47,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:47,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:47,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:12:48,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:12:48,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:12:48,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,075 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,084 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:48,102 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:12:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,131 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-31 17:12:48,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-31 17:12:48,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,159 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-31 17:12:48,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,173 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-31 17:12:48,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-31 17:12:48,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:48,194 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:12:48,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-31 17:12:48,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:48,210 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-31 17:12:48,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-31 17:12:48,224 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-31 17:12:48,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:12:48,255 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-31 17:12:48,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:12:48,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:12:48,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:12:48,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:12:48,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:12:48,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:12:48,275 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-31 17:12:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:51,414 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-31 17:12:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:12:51,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:12:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:51,415 INFO L225 Difference]: With dead ends: 372 [2019-01-31 17:12:51,416 INFO L226 Difference]: Without dead ends: 362 [2019-01-31 17:12:51,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:12:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-31 17:12:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-31 17:12:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-31 17:12:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-31 17:12:53,744 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-31 17:12:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:53,744 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-31 17:12:53,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:12:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-31 17:12:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:12:53,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:53,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:12:53,746 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-31 17:12:53,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:53,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:53,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:12:53,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:53,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:12:53,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:12:53,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:12:53,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:53,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:12:53,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:12:53,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:12:53,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:12:53,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:12:53,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:12:53,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:12:53,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:12:53,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:12:53,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:12:53,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:12:53,890 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:53,915 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:53,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:53,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:53,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:53,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:12:53,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:53,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:12:54,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:12:54,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:12:54,062 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:54,076 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:54,089 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:54,104 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:54,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:54,131 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:12:54,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:12:54,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:54,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:12:54,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:12:54,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:12:54,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:12:54,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:12:54,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:12:54,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:12:54,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:54,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 31 treesize of output 57 [2019-01-31 17:12:54,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:54,358 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-31 17:12:54,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-31 17:12:54,375 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-31 17:12:54,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:12:54,425 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-31 17:12:54,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:12:54,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:12:54,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:12:54,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:12:54,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:12:54,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:12:54,444 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-31 17:12:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:57,360 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-31 17:12:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:12:57,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:12:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:57,362 INFO L225 Difference]: With dead ends: 332 [2019-01-31 17:12:57,362 INFO L226 Difference]: Without dead ends: 325 [2019-01-31 17:12:57,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:12:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-31 17:12:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-31 17:12:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-31 17:12:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-31 17:12:59,783 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-31 17:12:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:59,784 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-31 17:12:59,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:12:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-31 17:12:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:12:59,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:59,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:12:59,785 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-31 17:12:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:59,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:12:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:59,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:59,864 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-31 17:12:59,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:59,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:12:59,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:12:59,865 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-31 17:12:59,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:12:59,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:12:59,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:12:59,868 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:12:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:59,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:12:59,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:59,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:12:59,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:59,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:12:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:59,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:12:59,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:12:59,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:12:59,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:12:59,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:59,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:12:59,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:59,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:13:00,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:13:00,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:13:00,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:13:00,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:13:00,059 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,079 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,100 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:00,136 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:13:00,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,184 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-31 17:13:00,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,202 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-31 17:13:00,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:13:00,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,230 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:00,230 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-31 17:13:00,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,251 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-31 17:13:00,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:13:00,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:00,277 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:00,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:13:00,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:00,298 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-31 17:13:00,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:13:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:00,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:00,363 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-31 17:13:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:13:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:13:00,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:13:00,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:13:00,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:13:00,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:13:00,383 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-31 17:13:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:03,033 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-31 17:13:03,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:13:03,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:13:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:03,035 INFO L225 Difference]: With dead ends: 294 [2019-01-31 17:13:03,035 INFO L226 Difference]: Without dead ends: 287 [2019-01-31 17:13:03,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:13:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-31 17:13:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-31 17:13:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-31 17:13:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-31 17:13:05,447 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-31 17:13:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:05,447 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-31 17:13:05,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:13:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-31 17:13:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:13:05,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:05,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:13:05,448 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-31 17:13:05,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:05,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:05,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:05,551 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-31 17:13:05,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:05,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:13:05,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:13:05,552 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-31 17:13:05,553 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:13:05,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:13:05,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:13:05,555 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:13:05,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:05,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:13:05,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:05,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:13:05,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:05,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:13:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:05,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:13:05,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:13:05,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:13:05,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:13:05,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:13:05,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:13:05,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,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 43 treesize of output 39 [2019-01-31 17:13:05,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:13:05,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:13:05,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:13:05,788 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,802 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:05,857 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:13:05,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:13:05,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:05,916 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-31 17:13:05,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:13:05,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:13:06,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:13:06,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:13:06,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-31 17:13:06,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,169 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:06,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-01-31 17:13:06,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:06,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:06,229 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:06,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-31 17:13:06,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:06,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:13:06,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-31 17:13:06,327 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-31 17:13:06,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:06,367 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-31 17:13:06,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:13:06,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:13:06,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:13:06,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:13:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:13:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:13:06,385 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-31 17:13:28,554 WARN L181 SmtUtils]: Spent 22.01 s on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-31 17:13:29,055 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-31 17:13:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:32,145 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-31 17:13:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:13:32,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:13:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:32,147 INFO L225 Difference]: With dead ends: 364 [2019-01-31 17:13:32,147 INFO L226 Difference]: Without dead ends: 357 [2019-01-31 17:13:32,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:13:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-31 17:13:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-31 17:13:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-31 17:13:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-31 17:13:34,687 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-31 17:13:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:34,687 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-31 17:13:34,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:13:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-31 17:13:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:13:34,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:34,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:13:34,688 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-31 17:13:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:34,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:34,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:35,083 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-01-31 17:13:35,238 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-31 17:13:35,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:35,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:13:35,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:13:35,239 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-31 17:13:35,240 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:13:35,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:13:35,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:13:35,242 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:13:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:35,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:13:35,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:35,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:13:35,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:35,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:13:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:35,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:13:35,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:13:35,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:13:35,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:13:35,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:13:35,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:13:35,288 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:13:35,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,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 36 treesize of output 49 [2019-01-31 17:13:35,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:13:35,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:13:35,457 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,470 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,484 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:35,527 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:13:35,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:13:35,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,589 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-31 17:13:35,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:13:35,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,615 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-31 17:13:35,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:35,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:35,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:13:35,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:35,662 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:35,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 77 [2019-01-31 17:13:35,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13: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-31 17:13:35,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:13:35,717 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-31 17:13:35,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:35,749 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-31 17:13:35,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:13:35,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:13:35,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:13:35,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:13:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:13:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:13:35,768 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-31 17:13:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:38,831 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-31 17:13:38,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:13:38,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:13:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:38,832 INFO L225 Difference]: With dead ends: 319 [2019-01-31 17:13:38,832 INFO L226 Difference]: Without dead ends: 312 [2019-01-31 17:13:38,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:13:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-31 17:13:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-31 17:13:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-31 17:13:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-31 17:13:41,751 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-31 17:13:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:41,751 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-31 17:13:41,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:13:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-31 17:13:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:13:41,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:41,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:13:41,752 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-31 17:13:41,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:41,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:41,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:41,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:41,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:41,864 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-31 17:13:41,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:41,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:13:41,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:13:41,865 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-31 17:13:41,866 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:13:41,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:13:41,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:13:41,868 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:13:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:41,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:13:41,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:41,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:13:41,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:41,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:13:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:41,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:13:41,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:13:41,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:13:41,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:13:41,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:41,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:13:41,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:13:42,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:13:42,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:13:42,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:13:42,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:13:42,079 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,099 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,120 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,129 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:42,156 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:13:42,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:13:42,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:13:42,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:13:42,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-31 17:13:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-31 17:13:42,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-31 17:13:42,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:13:42,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-31 17:13:42,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,543 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:42,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-31 17:13:42,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,605 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:42,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:42,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-31 17:13:42,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:42,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:13:42,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-31 17:13:42,703 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-31 17:13:42,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:42,738 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-31 17:13:42,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:13:42,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:13:42,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:13:42,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:13:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:13:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:13:42,756 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-31 17:13:44,100 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-31 17:13:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:47,133 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-31 17:13:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:13:47,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:13:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:47,135 INFO L225 Difference]: With dead ends: 392 [2019-01-31 17:13:47,135 INFO L226 Difference]: Without dead ends: 386 [2019-01-31 17:13:47,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:13:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-31 17:13:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-31 17:13:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-31 17:13:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-31 17:13:50,276 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-31 17:13:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:50,276 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-31 17:13:50,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:13:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-31 17:13:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:13:50,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:50,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:13:50,277 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-31 17:13:50,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:50,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:50,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:13:50,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:13:50,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:13:50,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:13:50,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:13:50,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:13:50,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:13:50,344 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-31 17:13:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:53,329 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-31 17:13:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:13:53,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 17:13:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:53,331 INFO L225 Difference]: With dead ends: 320 [2019-01-31 17:13:53,331 INFO L226 Difference]: Without dead ends: 315 [2019-01-31 17:13:53,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:13:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-31 17:13:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-31 17:13:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-31 17:13:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-31 17:13:56,465 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-31 17:13:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:56,465 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-31 17:13:56,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:13:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-31 17:13:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:13:56,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:56,466 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:13:56,466 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:56,466 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-31 17:13:56,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:56,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:56,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:13:56,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:56,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:13:56,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:13:56,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:13:56,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:56,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:13:56,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:13:56,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:13:56,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:13:56,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:13:56,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:13:56,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:13:56,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:13:56,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:13:56,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:13:56,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:13:56,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:13:56,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:13:56,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:13:56,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:13:56,723 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,744 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,756 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,765 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,774 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:56,801 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:13:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:13:56,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,854 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-31 17:13:56,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:13:56,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-31 17:13:56,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:56,916 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-31 17:13:56,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-31 17:13:56,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:56,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:13:56,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:13:57,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:13:57,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-31 17:13:57,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:57,108 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:13:57,109 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-31 17:13:57,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:57,130 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-31 17:13:57,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:13:57,156 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-31 17:13:57,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:57,216 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-31 17:13:57,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:13:57,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:13:57,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:13:57,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:13:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:13:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:13:57,235 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-31 17:14:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:14:03,589 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-31 17:14:03,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:14:03,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:14:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:14:03,591 INFO L225 Difference]: With dead ends: 601 [2019-01-31 17:14:03,591 INFO L226 Difference]: Without dead ends: 591 [2019-01-31 17:14:03,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:14:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-31 17:14:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-31 17:14:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-31 17:14:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-31 17:14:08,771 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-31 17:14:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:14:08,771 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-31 17:14:08,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:14:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-31 17:14:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:14:08,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:14:08,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:14:08,772 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:14:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-31 17:14:08,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:14:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:08,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:14:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:08,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:14:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:08,921 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-31 17:14:08,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:08,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:14:08,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:14:08,922 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:14:08,923 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:14:08,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:14:08,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:14:08,925 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:14:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:08,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:14:08,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:08,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:14:08,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:14:08,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:14:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:08,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:14:08,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:14:08,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:08,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:08,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:14:08,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:08,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:08,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:14:09,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:14:09,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:14:09,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:14:09,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:14:09,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:14:09,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:14:09,133 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,153 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,165 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,175 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,184 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:14:09,211 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:14:09,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:14:09,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,297 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-31 17:14:09,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:14:09,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-31 17:14:09,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:09,357 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-31 17:14:09,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-31 17:14:09,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,389 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:09,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:09,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-01-31 17:14:09,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:14:09,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:14:09,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-31 17:14:10,568 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2019-01-31 17:14:10,572 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-31 17:14:10,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:14:10,605 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-31 17:14:10,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:14:10,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:14:10,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:14:10,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:14:10,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:14:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:14:10,623 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-31 17:14:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:14:20,392 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-31 17:14:20,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:14:20,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:14:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:14:20,394 INFO L225 Difference]: With dead ends: 731 [2019-01-31 17:14:20,394 INFO L226 Difference]: Without dead ends: 718 [2019-01-31 17:14:20,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:14:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-31 17:14:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-31 17:14:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-31 17:14:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-31 17:14:28,905 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-31 17:14:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:14:28,905 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-31 17:14:28,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:14:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-31 17:14:28,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:14:28,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:14:28,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:14:28,906 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:14:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-31 17:14:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:14:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:28,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:14:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:28,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:14:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:28,983 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-31 17:14:28,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:28,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:14:28,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:14:28,984 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:14:28,984 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:14:28,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:14:28,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:14:28,986 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:14:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:28,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:14:28,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:28,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:14:29,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:14:29,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:14:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:29,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:14:29,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:14:29,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:14:29,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:14:29,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:14:29,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:14:29,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:14:29,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:14:29,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:14:29,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:14:29,237 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,291 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,303 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,313 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:14:29,351 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:14:29,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,398 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-31 17:14:29,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-31 17:14:29,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:14:29,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,467 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-31 17:14:29,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-31 17:14:29,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,497 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:29,498 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-31 17:14:29,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,519 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-31 17:14:29,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:14:29,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:29,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:29,549 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-31 17:14:29,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:29,573 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-31 17:14:29,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-31 17:14:29,627 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-31 17:14:29,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:14:29,692 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-31 17:14:29,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:14:29,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:14:29,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:14:29,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:14:29,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:14:29,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:14:29,712 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-31 17:14:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:14:40,010 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-31 17:14:40,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:14:40,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:14:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:14:40,012 INFO L225 Difference]: With dead ends: 480 [2019-01-31 17:14:40,012 INFO L226 Difference]: Without dead ends: 473 [2019-01-31 17:14:40,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:14:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-31 17:14:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-31 17:14:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-31 17:14:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-31 17:14:43,328 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-31 17:14:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:14:43,329 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-31 17:14:43,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:14:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-31 17:14:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:14:43,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:14:43,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:14:43,330 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:14:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-31 17:14:43,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:14:43,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:43,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:14:43,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:43,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:14:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:43,425 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-31 17:14:43,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:43,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:14:43,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:14:43,426 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-31 17:14:43,427 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:14:43,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:14:43,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:14:43,429 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:14:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:43,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:14:43,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:43,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:14:43,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:14:43,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:14:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:43,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:14:43,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:14:43,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:14:43,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:14:43,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:14:43,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:14:43,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:14:43,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:14:43,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:14:43,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:14:43,660 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,673 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,702 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:14:43,729 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:14:43,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,774 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-31 17:14:43,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,790 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-31 17:14:43,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:14:43,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:14:43,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:14:43,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:14:43,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,865 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:43,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:43,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-31 17:14:43,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:43,890 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-31 17:14:43,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:14:43,911 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-31 17:14:43,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:14:43,940 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-31 17:14:43,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:14:43,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:14:43,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:14:43,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:14:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:14:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:14:43,960 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-31 17:14:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:14:49,278 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-31 17:14:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:14:49,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:14:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:14:49,280 INFO L225 Difference]: With dead ends: 258 [2019-01-31 17:14:49,280 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 17:14:49,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:14:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 17:14:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-31 17:14:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-31 17:14:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-31 17:14:53,798 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-31 17:14:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:14:53,798 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-31 17:14:53,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:14:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-31 17:14:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:14:53,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:14:53,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:14:53,799 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:14:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-31 17:14:53,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:14:53,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:53,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:14:53,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:14:53,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:14:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:53,950 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-31 17:14:53,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:53,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:14:53,951 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:14:53,951 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-31 17:14:53,952 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:14:53,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:14:53,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:14:53,954 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:14:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:14:53,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:14:53,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:14:53,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:14:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:14:53,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:14:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:14:53,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:14:53,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:14:53,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:14:53,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:14:53,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:14:53,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:53,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:14:53,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,020 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:14:54,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:14:54,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:14:54,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:14:54,195 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,213 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,227 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,242 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,268 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-31 17:14:54,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:14:54,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,330 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-31 17:14:54,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-31 17:14:54,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,367 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:54,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:14:54,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:14:54,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:14:54,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-31 17:14:54,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,511 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:54,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-31 17:14:54,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-01-31 17:14:54,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:14:54,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-31 17:14:54,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:54,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-31 17:14:54,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:14:54,756 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:14:54,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-31 17:14:54,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:14:54,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:14:54,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-31 17:14:54,840 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-31 17:14:54,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:14:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:14:54,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:14:54,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:14:54,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:14:54,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:14:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:14:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:14:54,913 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-31 17:15:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:15:01,121 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-31 17:15:01,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:15:01,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:15:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:15:01,122 INFO L225 Difference]: With dead ends: 295 [2019-01-31 17:15:01,122 INFO L226 Difference]: Without dead ends: 284 [2019-01-31 17:15:01,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:15:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-31 17:15:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-31 17:15:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-31 17:15:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-31 17:15:05,896 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-31 17:15:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:15:05,896 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-31 17:15:05,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:15:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-31 17:15:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:15:05,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:15:05,897 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:15:05,897 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:15:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:15:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-31 17:15:05,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:15:05,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:15:05,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:15:05,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:15:05,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:15:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:15:06,004 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-31 17:15:06,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:15:06,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:15:06,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:15:06,005 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-31 17:15:06,006 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:15:06,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:15:06,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:15:06,007 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:15:06,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:15:06,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:15:06,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:15:06,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:15:06,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:15:06,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:15:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:15:06,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:15:06,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:15:06,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:15:06,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:15:06,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:15:06,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:15:06,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:15:06,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:15:06,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:15:06,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:15:06,226 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,240 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,268 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:15:06,295 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:15:06,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:15:06,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,340 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-31 17:15:06,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:15:06,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:15:06,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:15:06,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:15:06,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-31 17:15:06,727 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-01-31 17:15:06,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:06,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:15:06,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:06,767 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-31 17:15:06,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-31 17:15:06,786 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-31 17:15:06,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:15:06,810 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-31 17:15:06,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:15:06,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:15:06,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:15:06,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:15:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:15:06,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:15:06,829 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-31 17:15:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:15:13,822 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-31 17:15:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:15:13,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:15:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:15:13,824 INFO L225 Difference]: With dead ends: 328 [2019-01-31 17:15:13,824 INFO L226 Difference]: Without dead ends: 315 [2019-01-31 17:15:13,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:15:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-31 17:15:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-31 17:15:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-31 17:15:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-31 17:15:20,569 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-31 17:15:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:15:20,569 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-31 17:15:20,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:15:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-31 17:15:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:15:20,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:15:20,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:15:20,570 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:15:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:15:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-31 17:15:20,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:15:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:15:20,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:15:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:15:20,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:15:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:15:20,721 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-31 17:15:20,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:15:20,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:15:20,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:15:20,722 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-31 17:15:20,723 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:15:20,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:15:20,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:15:20,725 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:15:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:15:20,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:15:20,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:15:20,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:15:20,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:15:20,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:15:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:15:20,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:15:20,943 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-31 17:15:20,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:20,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:15:20,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:20,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:20,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:15:21,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:15:21,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:15:21,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:15:21,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:15:21,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:15:21,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:15:21,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:15:21,171 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,194 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,207 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,231 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:15:21,260 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:15:21,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:15:21,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,322 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-31 17:15:21,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:15:21,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:15:21,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,389 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-31 17:15:21,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:15:21,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,422 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:15:21,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:21,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:15:21,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:21,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:15:21,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-31 17:15:21,486 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-31 17:15:21,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:15:21,529 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-31 17:15:21,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:15:21,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:15:21,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:15:21,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:15:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:15:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:15:21,547 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-31 17:15:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:15:30,980 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-31 17:15:30,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:15:30,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:15:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:15:30,982 INFO L225 Difference]: With dead ends: 326 [2019-01-31 17:15:30,982 INFO L226 Difference]: Without dead ends: 313 [2019-01-31 17:15:30,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:15:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-31 17:15:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-31 17:15:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-31 17:15:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-31 17:15:39,128 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-31 17:15:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:15:39,128 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-31 17:15:39,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:15:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-31 17:15:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:15:39,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:15:39,129 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:15:39,129 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:15:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:15:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-31 17:15:39,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:15:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:15:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:15:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:15:39,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:15:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:15:39,198 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-31 17:15:39,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:15:39,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:15:39,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:15:39,199 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-31 17:15:39,199 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:15:39,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:15:39,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:15:39,201 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:15:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:15:39,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:15:39,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:15:39,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:15:39,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:15:39,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:15:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:15:39,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:15:39,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:15:39,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:15:39,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:15:39,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:15:39,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:15:39,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:15:39,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:15:39,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:15:39,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:15:39,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,463 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:15:39,489 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:15:39,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:15:39,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:15:39,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:15:39,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-31 17:15:39,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,660 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:15:39,661 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-31 17:15:39,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,680 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-31 17:15:39,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-31 17:15:39,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,706 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-31 17:15:39,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,725 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-31 17:15:39,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:15:39,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:15:39,754 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-31 17:15:39,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:15:39,780 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-31 17:15:39,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-31 17:15:39,801 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-31 17:15:39,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:15:39,845 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-31 17:15:39,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:15:39,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:15:39,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:15:39,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:15:39,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:15:39,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:15:39,865 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-31 17:15:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:15:51,104 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-31 17:15:51,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:15:51,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:15:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:15:51,106 INFO L225 Difference]: With dead ends: 400 [2019-01-31 17:15:51,106 INFO L226 Difference]: Without dead ends: 393 [2019-01-31 17:15:51,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:15:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-31 17:16:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-31 17:16:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-31 17:16:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-31 17:16:01,314 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-31 17:16:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:16:01,314 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-31 17:16:01,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:16:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-31 17:16:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:16:01,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:16:01,315 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:16:01,315 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:16:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:16:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-31 17:16:01,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:16:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:16:01,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:16:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:16:01,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:16:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:16:01,406 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-31 17:16:01,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:16:01,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:16:01,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:16:01,407 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-31 17:16:01,408 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:16:01,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:16:01,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:16:01,410 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:16:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:16:01,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:16:01,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:16:01,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:16:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:16:01,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:16:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:16:01,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:16:01,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:16:01,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:16:01,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:16:01,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:16:01,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:16:01,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:16:01,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:16:01,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:16:01,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:16:01,644 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,658 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,687 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:16:01,714 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:16:01,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:16:01,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:16:01,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:01,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-31 17:16:01,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:16:01,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-01-31 17:16:01,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:01,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:01,971 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:16:01,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-01-31 17:16:01,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:02,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:02,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-31 17:16:02,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-01-31 17:16:02,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:02,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,122 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:16:02,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-31 17:16:02,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:02,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:02,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-31 17:16:02,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-01-31 17:16:02,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:02,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:02,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-31 17:16:02,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:02,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:02,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-31 17:16:02,360 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-31 17:16:02,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:16:02,413 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-31 17:16:02,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:16:02,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:16:02,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:16:02,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:16:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:16:02,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:16:02,432 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-31 17:16:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:16:14,737 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-31 17:16:14,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:16:14,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:16:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:16:14,739 INFO L225 Difference]: With dead ends: 441 [2019-01-31 17:16:14,739 INFO L226 Difference]: Without dead ends: 428 [2019-01-31 17:16:14,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:16:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-31 17:16:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-31 17:16:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-31 17:16:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-31 17:16:24,993 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-31 17:16:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:16:24,993 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-31 17:16:24,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:16:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-31 17:16:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:16:24,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:16:24,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:16:24,995 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:16:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:16:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-31 17:16:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:16:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:16:24,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:16:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:16:24,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:16:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:16:25,260 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-31 17:16:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-31 17:16:25,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:16:25,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:16:25,336 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:16:25,337 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-31 17:16:25,337 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:16:25,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:16:25,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:16:25,339 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:16:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:16:25,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:16:25,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:16:25,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:16:25,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:16:25,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:16:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:16:25,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:16:25,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:16:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:16:25,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:16:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:16:25,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:16:25,385 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,410 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:16:25,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:16:25,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:16:25,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:16:25,554 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,568 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,597 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:16:25,624 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:16:25,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:16:25,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:16:25,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:25,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-31 17:16:25,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-01-31 17:16:25,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-01-31 17:16:25,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:25,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:25,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-31 17:16:25,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:25,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:16:26,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-31 17:16:26,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:16:26,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-31 17:16:26,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:26,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:26,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-31 17:16:26,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,158 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:16:26,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-01-31 17:16:26,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:26,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:16:26,220 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:16:26,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-01-31 17:16:26,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:16:26,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:16:26,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-31 17:16:26,325 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-31 17:16:26,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:16:26,389 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-31 17:16:26,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:16:26,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:16:26,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:16:26,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:16:26,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:16:26,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:16:26,408 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-31 17:16:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:16:46,397 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-31 17:16:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:16:46,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:16:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:16:46,399 INFO L225 Difference]: With dead ends: 685 [2019-01-31 17:16:46,399 INFO L226 Difference]: Without dead ends: 677 [2019-01-31 17:16:46,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:16:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-31 17:17:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-31 17:17:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-31 17:17:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-31 17:17:01,745 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-31 17:17:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:17:01,746 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-31 17:17:01,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:17:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-31 17:17:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:17:01,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:17:01,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:17:01,747 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:17:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-31 17:17:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:17:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:17:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:01,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:17:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:01,940 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-31 17:17:01,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:01,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:17:01,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:17:01,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:17:01,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:01,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:17:01,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:17:01,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:17:01,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:17:01,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:17:01,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:17:01,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:17:01,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:01,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:01,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:17:02,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:17:02,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:17:02,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:17:02,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:17:02,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:17:02,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:17:02,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:17:02,134 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,155 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,167 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,176 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:17:02,212 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:17:02,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:17:02,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:17:02,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:02,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-31 17:17:02,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-31 17:17:02,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:02,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 45 treesize of output 51 [2019-01-31 17:17:02,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:02,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:02,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-31 17:17:02,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:02,964 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:02,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-31 17:17:02,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:03,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-31 17:17:03,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:03,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:03,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-31 17:17:03,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-31 17:17:03,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:03,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:03,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:03,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-01-31 17:17:03,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:03,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:03,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-31 17:17:03,282 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-31 17:17:03,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:17:03,336 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-31 17:17:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:17:03,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:17:03,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:17:03,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:17:03,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:17:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:17:03,355 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-31 17:17:03,761 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-31 17:17:04,246 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-31 17:17:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:17:18,597 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-31 17:17:18,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:17:18,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-31 17:17:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:17:18,598 INFO L225 Difference]: With dead ends: 550 [2019-01-31 17:17:18,599 INFO L226 Difference]: Without dead ends: 543 [2019-01-31 17:17:18,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:17:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-31 17:17:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-31 17:17:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:17:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-31 17:17:21,623 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-31 17:17:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:17:21,623 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-31 17:17:21,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:17:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-31 17:17:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:17:21,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:17:21,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:17:21,623 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:17:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-31 17:17:21,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:17:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:21,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:17:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:21,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:17:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:21,773 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-31 17:17:21,819 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-31 17:17:21,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:21,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:17:21,820 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 17:17:21,820 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:17:21,820 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:17:21,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:17:21,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:17:21,823 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:17:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:21,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:17:21,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:21,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:17:21,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:17:21,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:17:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:21,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:17:21,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:17:21,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:17:21,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:17:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:21,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:17:21,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:21,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:22,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:22,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:22,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:17:22,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:17:22,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:17:22,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:17:22,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:17:22,087 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:22,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:22,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:22,837 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:22,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:23,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:17:23,364 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:17:23,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:17:23,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:23,574 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-31 17:17:23,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:17:23,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:17:23,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:23,642 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-31 17:17:23,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:17:23,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,676 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:23,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:17:23,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:23,712 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-31 17:17:23,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-31 17:17:23,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:23,925 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:23,925 INFO L303 Elim1Store]: Index analysis took 191 ms [2019-01-31 17:17:23,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-31 17:17:23,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:23,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:17:23,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:17:24,224 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-31 17:17:24,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:17:24,319 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-31 17:17:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:17:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:17:24,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:17:24,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:17:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:17:24,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:17:24,340 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-31 17:17:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:17:30,172 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-31 17:17:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:17:30,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-31 17:17:30,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:17:30,173 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:17:30,173 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:17:30,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:17:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:17:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-31 17:17:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:17:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-31 17:17:33,426 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-31 17:17:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:17:33,426 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-31 17:17:33,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:17:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-31 17:17:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:17:33,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:17:33,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:17:33,427 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:17:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-31 17:17:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:17:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:33,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:17:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:33,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:17:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 17:17:33,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:33,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:17:33,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 17:17:33,557 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-31 17:17:33,557 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:17:33,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:17:33,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:17:33,559 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:17:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:33,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:17:33,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:33,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:17:33,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:17:33,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:17:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:33,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:17:33,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:17:33,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:17:33,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:17:33,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:17:33,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:17:33,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:17:33,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:17:33,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:17:33,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:17:33,754 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,775 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,796 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,832 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-31 17:17:33,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:17:33,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:33,894 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-31 17:17:33,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-31 17:17:33,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:33,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:17:33,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:17:34,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:34,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-31 17:17:34,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,093 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:34,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-31 17:17:34,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:34,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,156 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:34,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-01-31 17:17:34,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:34,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:34,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-31 17:17:34,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,272 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:34,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-01-31 17:17:34,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:34,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:34,341 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:34,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-31 17:17:34,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:34,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:34,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-31 17:17:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:17:34,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:17:34,497 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-31 17:17:34,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:17:34,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:17:34,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:17:34,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:17:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:17:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:17:34,517 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-31 17:17:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:17:40,787 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-31 17:17:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:17:40,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-31 17:17:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:17:40,788 INFO L225 Difference]: With dead ends: 74 [2019-01-31 17:17:40,788 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 17:17:40,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:17:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 17:17:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-31 17:17:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:17:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-31 17:17:44,362 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-31 17:17:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:17:44,362 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-31 17:17:44,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:17:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-31 17:17:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:17:44,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:17:44,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:17:44,362 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:17:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-31 17:17:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:17:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:44,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:17:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:44,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:17:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:44,498 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-31 17:17:44,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:44,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:17:44,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 17:17:44,498 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:17:44,499 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:17:44,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:17:44,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:17:44,501 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:17:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:44,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:17:44,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:44,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:17:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:17:44,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:17:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:44,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:17:44,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:17:44,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:17:44,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:17:44,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:17:44,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:17:44,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:17:44,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:17:44,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-31 17:17:44,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-31 17:17:44,732 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,753 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,765 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,774 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:17:44,810 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:17:44,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:17:44,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,874 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-31 17:17:44,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:17:44,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:44,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:17:44,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:44,921 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-31 17:17:44,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:17:45,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,025 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:45,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-31 17:17:45,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:45,050 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-31 17:17:45,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:17:45,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:45,080 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:45,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:17:45,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:45,103 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-31 17:17:45,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:17:45,126 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-31 17:17:45,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:17:45,165 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-31 17:17:45,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:17:45,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:17:45,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:17:45,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:17:45,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:17:45,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:17:45,183 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-31 17:17:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:17:52,425 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-31 17:17:52,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:17:52,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-31 17:17:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:17:52,426 INFO L225 Difference]: With dead ends: 80 [2019-01-31 17:17:52,426 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:17:52,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:17:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:17:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-31 17:17:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-31 17:17:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-31 17:17:58,918 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-31 17:17:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:17:58,918 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-31 17:17:58,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:17:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-31 17:17:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 17:17:58,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:17:58,919 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:17:58,919 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:17:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:17:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-31 17:17:58,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:17:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:58,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:17:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:17:58,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:17:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:17:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-31 17:17:59,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:59,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:17:59,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:17:59,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:17:59,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:17:59,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:17:59,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:17:59,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:17:59,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:17:59,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:17:59,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:17:59,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:17:59,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:17:59,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-31 17:17:59,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-31 17:17:59,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:17:59,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-31 17:17:59,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:17:59,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-31 17:17:59,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-31 17:17:59,145 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,152 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,159 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,166 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:17:59,182 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-31 17:17:59,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:17:59,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:17:59,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:17:59,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-31 17:17:59,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-31 17:17:59,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-31 17:17:59,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:17:59,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-31 17:17:59,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-31 17:17:59,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,406 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-31 17:17:59,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:59,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-31 17:17:59,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:17:59,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-31 17:17:59,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:59,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-31 17:17:59,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:17:59,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-01-31 17:17:59,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:17:59,572 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-31 17:17:59,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:17:59,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:17:59,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-31 17:17:59,621 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-31 17:17:59,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:17:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:17:59,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:17:59,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:17:59,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:17:59,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:17:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:17:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:17:59,707 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-31 17:18:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:18:06,577 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-31 17:18:06,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:18:06,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-31 17:18:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:18:06,578 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:18:06,578 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:18:06,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:18:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:18:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:18:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:18:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:18:06,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-31 17:18:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:18:06,580 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:18:06,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:18:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:18:06,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:18:06,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:18:06,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:06,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:06,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:06,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:12,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:18,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:20,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:21,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:22,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:24,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:44,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:18:55,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent.