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-f57a05f [2019-01-08 14:04:30,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:04:30,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:04:30,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:04:30,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:04:30,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:04:30,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:04:30,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:04:30,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:04:30,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:04:30,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:04:30,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:04:30,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:04:30,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:04:30,131 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:04:30,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:04:30,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:04:30,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:04:30,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:04:30,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:04:30,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:04:30,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:04:30,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:04:30,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:04:30,143 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:04:30,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:04:30,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:04:30,146 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:04:30,147 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:04:30,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:04:30,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:04:30,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:04:30,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:04:30,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:04:30,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:04:30,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:04:30,151 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-08 14:04:30,164 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:04:30,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:04:30,168 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:04:30,168 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:04:30,168 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:04:30,168 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:04:30,169 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:04:30,169 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:04:30,169 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:04:30,169 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:04:30,170 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:04:30,170 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:04:30,170 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:04:30,170 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:04:30,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:04:30,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:04:30,172 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:04:30,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:04:30,172 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:04:30,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:04:30,172 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:04:30,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:04:30,173 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:04:30,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:04:30,173 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:04:30,173 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:04:30,174 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:04:30,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:04:30,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:04:30,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:04:30,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:04:30,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:04:30,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:04:30,176 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:04:30,176 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:04:30,176 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:04:30,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:04:30,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:04:30,177 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:04:30,177 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:04:30,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:04:30,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:04:30,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:04:30,236 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:04:30,236 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:04:30,237 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-08 14:04:30,237 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-08 14:04:30,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:04:30,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:04:30,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:30,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:04:30,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:04:30,301 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,312 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:30,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:04:30,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:04:30,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:04:30,358 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,358 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,360 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,360 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,364 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,368 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,369 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 08.01 02:04:30" (1/1) ... [2019-01-08 14:04:30,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:04:30,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:04:30,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:04:30,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:04:30,373 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 08.01 02:04:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:04:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:04:30,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:04:30,817 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:04:30,817 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-08 14:04:30,819 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:30 BoogieIcfgContainer [2019-01-08 14:04:30,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:04:30,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:04:30,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:04:30,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:04:30,829 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 08.01 02:04:30" (1/2) ... [2019-01-08 14:04:30,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678bf7b and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:04:30, skipping insertion in model container [2019-01-08 14:04:30,830 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 08.01 02:04:30" (2/2) ... [2019-01-08 14:04:30,833 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-08 14:04:30,844 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:04:30,852 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-08 14:04:30,870 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-08 14:04:30,903 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:04:30,904 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:04:30,904 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:04:30,904 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:04:30,904 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:04:30,904 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:04:30,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:04:30,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:04:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-08 14:04:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:04:30,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:30,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:04:30,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-08 14:04:30,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:30,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:30,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:31,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:31,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:31,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:31,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:31,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:31,160 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-08 14:04:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:31,410 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-08 14:04:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:31,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:04:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:31,425 INFO L225 Difference]: With dead ends: 25 [2019-01-08 14:04:31,426 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 14:04:31,429 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-08 14:04:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 14:04:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-08 14:04:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 14:04:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-08 14:04:31,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-08 14:04:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:31,468 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-08 14:04:31,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-08 14:04:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:31,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:31,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:31,470 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-08 14:04:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:31,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,648 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-08 14:04:31,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:31,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:31,652 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-08 14:04:31,691 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:31,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:31,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:31,783 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-08 14:04:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:31,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:31,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,792 INFO 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-08 14:04:31,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:31,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:32,024 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-08 14:04:32,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,066 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-08 14:04:32,364 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-08 14:04:32,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,388 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-08 14:04:32,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,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-08 14:04:32,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,740 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-08 14:04:32,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, 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-08 14:04:32,753 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-08 14:04:32,763 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-08 14:04:32,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-08 14:04:32,799 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,835 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,863 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,893 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,969 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-08 14:04:32,969 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:33,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,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, 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-08 14:04:33,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,189 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-08 14:04:33,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:33,243 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-08 14:04:33,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:33,358 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-08 14:04:33,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:33,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:33,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:33,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:33,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:33,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:33,380 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-08 14:04:33,533 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-08 14:04:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:34,061 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-08 14:04:34,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:34,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:34,063 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:04:34,063 INFO L226 Difference]: Without dead ends: 37 [2019-01-08 14:04:34,065 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-08 14:04:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-08 14:04:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-08 14:04:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 14:04:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-08 14:04:34,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-08 14:04:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:34,072 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-08 14:04:34,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-08 14:04:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:34,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:34,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:34,074 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-08 14:04:34,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:34,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:34,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:34,174 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-08 14:04:34,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:34,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:34,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:34,175 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-08 14:04:34,179 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:34,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:34,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:34,190 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-08 14:04:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:34,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:34,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:34,191 INFO 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-08 14:04:34,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:34,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:34,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:34,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,337 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-08 14:04:34,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,386 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-08 14:04:34,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,445 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-08 14:04:34,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,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, 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-08 14:04:34,610 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-08 14:04:34,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:34,636 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-08 14:04:34,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:34,691 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,723 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,763 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,777 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,863 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-08 14:04:34,864 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:34,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,967 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-08 14:04:34,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:04:35,191 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-08 14:04:35,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-01-08 14:04:35,317 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-08 14:04:35,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:35,324 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-08 14:04:35,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:35,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:04:35,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:35,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:35,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:04:35,345 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-08 14:04:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:35,411 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-08 14:04:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:35,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:04:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:35,413 INFO L225 Difference]: With dead ends: 18 [2019-01-08 14:04:35,413 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 14:04:35,413 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-08 14:04:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 14:04:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-08 14:04:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:04:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-08 14:04:35,418 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-08 14:04:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:35,418 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-08 14:04:35,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-08 14:04:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:35,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:35,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:35,419 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-08 14:04:35,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:35,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:35,457 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-08 14:04:35,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:35,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:35,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:35,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:35,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:35,458 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-08 14:04:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:35,510 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-08 14:04:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:35,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 14:04:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:35,512 INFO L225 Difference]: With dead ends: 21 [2019-01-08 14:04:35,512 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 14:04:35,512 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-08 14:04:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 14:04:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-08 14:04:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:04:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-08 14:04:35,517 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-08 14:04:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:35,517 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-08 14:04:35,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-08 14:04:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:35,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:35,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:35,518 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-08 14:04:35,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:35,625 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-08 14:04:35,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:35,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:35,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:35,626 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-08 14:04:35,627 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:35,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:35,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:35,634 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-08 14:04:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:35,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:35,634 INFO 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-08 14:04:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:35,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:35,669 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-08 14:04:35,672 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-08 14:04:35,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,689 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-08 14:04:35,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04: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, 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-08 14:04:35,729 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-08 14:04:35,730 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,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, 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-08 14:04:35,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:35,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,006 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-08 14:04:36,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,027 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,039 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,066 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-08 14:04:36,067 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:36,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,118 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-08 14:04:36,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,147 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-08 14:04:36,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:36,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-08 14:04:36,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:36,198 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-08 14:04:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:36,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:36,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:36,218 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-08 14:04:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:36,426 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-08 14:04:36,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:36,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:36,429 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:04:36,429 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 14:04:36,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 14:04:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-08 14:04:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 14:04:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-08 14:04:36,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-08 14:04:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:36,437 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-08 14:04:36,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-08 14:04:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:36,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:36,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:36,438 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-08 14:04:36,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:36,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:36,517 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-08 14:04:36,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:36,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:36,518 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:36,518 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-08 14:04:36,520 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:36,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:36,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:36,525 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-08 14:04:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:36,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:36,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:36,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:04:36,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:36,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:36,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:36,582 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-08 14:04:36,599 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-08 14:04:36,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,662 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-08 14:04:36,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,722 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-08 14:04:36,741 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-08 14:04:36,742 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,899 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-08 14:04:36,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,002 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-08 14:04:37,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,040 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-08 14:04:37,041 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,051 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,059 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,084 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-08 14:04:37,085 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:37,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,173 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-08 14:04:37,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:04:37,252 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-08 14:04:37,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-08 14:04:37,571 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-08 14:04:37,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,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, 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-08 14:04:37,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-08 14:04:38,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,188 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:38,189 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-08 14:04:38,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,438 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-08 14:04:38,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-08 14:04:38,557 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-08 14:04:38,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:38,610 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-08 14:04:38,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:38,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:38,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:38,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:38,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:38,632 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-08 14:04:40,933 WARN L181 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-01-08 14:04:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:41,268 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-08 14:04:41,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:41,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:41,271 INFO L225 Difference]: With dead ends: 59 [2019-01-08 14:04:41,271 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:04:41,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:04:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-08 14:04:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-08 14:04:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-08 14:04:41,280 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-08 14:04:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:41,281 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-08 14:04:41,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-08 14:04:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:41,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:41,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:41,282 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-08 14:04:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:41,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:41,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:41,379 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-08 14:04:41,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:41,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:41,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:41,380 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-08 14:04:41,381 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:41,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:41,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:41,392 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-08 14:04:41,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:41,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:41,392 INFO 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-08 14:04:41,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:41,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:41,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:41,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:41,420 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-08 14:04:41,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:41,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,454 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-08 14:04:41,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, 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-08 14:04:41,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:41,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-08 14:04:41,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,740 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-08 14:04:41,741 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,750 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,761 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,783 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-08 14:04:41,784 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-08 14:04:41,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,817 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-08 14:04:41,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,836 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-08 14:04:41,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-08 14:04:41,856 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-08 14:04:41,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:41,867 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-08 14:04:41,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:41,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:04:41,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:41,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:41,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:41,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:41,889 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-08 14:04:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:41,985 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-08 14:04:41,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:41,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:04:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:41,988 INFO L225 Difference]: With dead ends: 25 [2019-01-08 14:04:41,988 INFO L226 Difference]: Without dead ends: 24 [2019-01-08 14:04:41,989 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-08 14:04:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-08 14:04:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-08 14:04:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 14:04:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-08 14:04:42,004 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-08 14:04:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:42,004 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-08 14:04:42,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-08 14:04:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:42,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:42,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:42,007 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-08 14:04:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:42,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-08 14:04:42,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:42,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:42,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:42,194 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-08 14:04:42,197 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:42,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:42,203 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:42,203 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-08 14:04:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:42,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:42,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:42,204 INFO 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-08 14:04:42,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:42,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:42,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:42,257 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-08 14:04:42,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:42,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,270 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-08 14:04:42,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,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-08 14:04:42,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:42,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,314 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,344 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,378 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-08 14:04:42,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,405 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-08 14:04:42,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,491 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-08 14:04:42,492 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,503 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,513 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,539 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-08 14:04:42,539 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:42,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,612 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-08 14:04:42,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,640 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-08 14:04:42,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:42,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:42,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:04:42,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,755 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-08 14:04:42,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-08 14:04:42,775 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-08 14:04:42,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:42,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:42,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:42,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:42,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:42,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:42,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:42,827 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-08 14:04:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:43,390 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-08 14:04:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:43,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:43,392 INFO L225 Difference]: With dead ends: 56 [2019-01-08 14:04:43,393 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:04:43,393 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-08 14:04:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:04:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-08 14:04:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-08 14:04:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-08 14:04:43,403 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-08 14:04:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:43,404 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-08 14:04:43,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-08 14:04:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:43,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:43,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:43,405 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-08 14:04:43,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,536 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-08 14:04:43,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:43,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:43,537 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-08 14:04:43,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:43,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:43,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:43,542 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-08 14:04:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:43,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,543 INFO 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-08 14:04:43,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:43,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:43,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,575 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-08 14:04:43,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,607 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-08 14:04:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,644 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-08 14:04:43,645 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:43,694 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-08 14:04:43,699 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-08 14:04:43,702 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-08 14:04:43,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:43,732 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,756 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,771 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,796 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,819 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-08 14:04:43,819 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:43,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,863 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-08 14:04:43,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:43,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:43,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,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 67 [2019-01-08 14:04:43,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,935 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-08 14:04:43,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:43,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:43,976 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-08 14:04:43,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:43,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:43,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:43,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:43,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:43,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:43,997 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-08 14:04:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:44,344 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-08 14:04:44,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:44,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:44,345 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:04:44,345 INFO L226 Difference]: Without dead ends: 48 [2019-01-08 14:04:44,346 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-08 14:04:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-08 14:04:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-08 14:04:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:04:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-08 14:04:44,353 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-08 14:04:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:44,354 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-08 14:04:44,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-08 14:04:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:44,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:44,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:44,355 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:44,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:44,355 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-08 14:04:44,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:44,388 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-08 14:04:44,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:44,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:44,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:44,390 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-08 14:04:44,392 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:44,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:44,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:44,396 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-08 14:04:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:44,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:44,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:44,397 INFO 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-08 14:04:44,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:44,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:44,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:44,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:44,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-08 14:04:44,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,453 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-08 14:04:44,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,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, 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-08 14:04:44,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,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-08 14:04:44,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,513 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-08 14:04:44,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,582 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-08 14:04:44,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,620 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-08 14:04:44,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,700 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-08 14:04:44,700 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,716 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,746 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,774 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-08 14:04:44,775 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-08 14:04:44,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,876 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-08 14:04:44,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,904 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-08 14:04:44,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-08 14:04:44,919 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-08 14:04:44,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:44,933 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-08 14:04:44,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:44,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:44,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:44,954 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-08 14:04:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:45,090 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-08 14:04:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:45,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:04:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:45,093 INFO L225 Difference]: With dead ends: 42 [2019-01-08 14:04:45,093 INFO L226 Difference]: Without dead ends: 41 [2019-01-08 14:04:45,093 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-08 14:04:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-08 14:04:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-08 14:04:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:04:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-08 14:04:45,100 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-08 14:04:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:45,100 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-08 14:04:45,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-08 14:04:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:45,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:45,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:45,101 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-08 14:04:45,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:45,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:45,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:45,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:45,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:45,170 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-08 14:04:45,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:45,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:45,170 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:45,170 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-08 14:04:45,171 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:45,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:45,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:45,176 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-08 14:04:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:45,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:45,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:45,177 INFO 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-08 14:04:45,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:45,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:45,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:45,217 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-08 14:04:45,227 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-08 14:04:45,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,233 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-08 14:04:45,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,249 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-08 14:04:45,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:45,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,294 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,368 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-08 14:04:45,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,403 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-08 14:04:45,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:45,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,490 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-08 14:04:45,491 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,505 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,520 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,536 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,566 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-08 14:04:45,566 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-08 14:04:45,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,590 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-08 14:04:45,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,621 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-08 14:04:45,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-08 14:04:45,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,650 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-08 14:04:45,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,684 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-08 14:04:45,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-08 14:04:45,705 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-08 14:04:45,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:45,726 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-08 14:04:45,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:45,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:45,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:45,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:45,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:45,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:45,747 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-08 14:04:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:46,173 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-08 14:04:46,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:46,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:46,175 INFO L225 Difference]: With dead ends: 54 [2019-01-08 14:04:46,175 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 14:04:46,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 14:04:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-08 14:04:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-08 14:04:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-08 14:04:46,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-08 14:04:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:46,187 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-08 14:04:46,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-08 14:04:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:46,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:46,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:46,188 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-08 14:04:46,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:46,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:46,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:46,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:46,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:46,313 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-08 14:04:46,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:46,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:46,314 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:46,314 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-08 14:04:46,314 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:46,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:46,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:46,319 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-08 14:04:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:46,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:46,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:46,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:04:46,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:46,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:46,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:46,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,364 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-08 14:04:46,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:46,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,448 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-08 14:04:46,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,486 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-08 14:04:46,489 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-08 14:04:46,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:46,498 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-08 14:04:46,507 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-08 14:04:46,508 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,527 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,541 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,563 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,584 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-08 14:04:46,585 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:46,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,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, 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-08 14:04:46,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:46,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:04:46,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:04:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:46,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:46,731 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-08 14:04:46,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:46,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:46,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:46,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:46,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:46,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:46,751 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-08 14:04:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:47,037 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-08 14:04:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:47,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:47,038 INFO L225 Difference]: With dead ends: 63 [2019-01-08 14:04:47,038 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 14:04:47,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 14:04:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-08 14:04:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:04:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-08 14:04:47,050 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-08 14:04:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:47,050 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-08 14:04:47,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-08 14:04:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:47,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:47,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:47,051 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-08 14:04:47,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:47,104 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-08 14:04:47,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:47,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:04:47,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:47,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:04:47,106 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-08 14:04:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:47,222 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-08 14:04:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:47,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:04:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:47,223 INFO L225 Difference]: With dead ends: 41 [2019-01-08 14:04:47,224 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 14:04:47,224 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-08 14:04:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 14:04:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-08 14:04:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 14:04:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-08 14:04:47,234 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-08 14:04:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:47,234 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-08 14:04:47,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-08 14:04:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:47,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:47,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:47,236 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-08 14:04:47,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:47,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:47,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:47,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:47,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,316 INFO 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-08 14:04:47,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:47,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:47,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:04:47,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:47,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:47,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, 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-08 14:04:47,369 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-08 14:04:47,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,375 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-08 14:04:47,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,382 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-08 14:04:47,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,396 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-08 14:04:47,397 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,424 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,496 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-08 14:04:47,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,536 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-08 14:04:47,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,614 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-08 14:04:47,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,666 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-08 14:04:47,666 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,683 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,699 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,716 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,747 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-08 14:04:47,748 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-08 14:04:47,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:04:47,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,191 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-08 14:04:48,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-08 14:04:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,309 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:48,310 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-08 14:04:48,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,341 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-08 14:04:48,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-08 14:04:48,359 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-08 14:04:48,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:48,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-08 14:04:48,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:48,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:48,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:48,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:48,406 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-08 14:04:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:48,835 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-08 14:04:48,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:48,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:48,837 INFO L225 Difference]: With dead ends: 57 [2019-01-08 14:04:48,837 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:04:48,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:04:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-08 14:04:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 14:04:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-08 14:04:48,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-08 14:04:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:48,851 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-08 14:04:48,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-08 14:04:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:48,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:48,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:48,853 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-08 14:04:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:48,935 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-08 14:04:48,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:48,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:48,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:48,936 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-08 14:04:48,937 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:48,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:48,944 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:48,944 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-08 14:04:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:48,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:48,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:48,945 INFO 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-08 14:04:48,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:48,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:48,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:48,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,991 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-08 14:04:49,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-08 14:04:49,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,081 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-08 14:04:49,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:04:49,170 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-08 14:04:49,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:49,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-08 14:04:49,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:49,184 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,202 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,215 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,265 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-08 14:04:49,265 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:49,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,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, 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-08 14:04:49,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,360 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-08 14:04:49,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:49,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:04:49,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,425 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-08 14:04:49,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:49,460 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-08 14:04:49,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:49,481 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-08 14:04:49,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:49,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:49,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:49,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:49,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:49,502 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-08 14:04:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:49,864 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-08 14:04:49,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:49,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:49,865 INFO L225 Difference]: With dead ends: 61 [2019-01-08 14:04:49,865 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 14:04:49,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 14:04:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-08 14:04:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 14:04:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-08 14:04:49,880 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-08 14:04:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:49,880 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-08 14:04:49,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-08 14:04:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:49,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:49,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:49,881 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-08 14:04:49,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:49,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:49,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:49,941 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-08 14:04:49,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:49,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:49,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:49,942 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-08 14:04:49,943 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:49,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:49,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:49,947 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-08 14:04:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:49,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:49,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:49,948 INFO 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-08 14:04:49,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:49,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:49,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:49,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:50,012 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-08 14:04:50,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:50,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:50,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:04:50,071 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,098 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:50,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:50,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-08 14:04:50,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,250 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-08 14:04:50,251 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,265 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,279 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,295 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,573 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-08 14:04:50,574 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-08 14:04:50,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,721 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-08 14:04:50,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,749 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-08 14:04:50,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-08 14:04:50,765 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-08 14:04:50,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:50,776 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-08 14:04:50,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:50,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:50,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:50,797 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-08 14:04:51,286 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-08 14:04:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:51,693 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-08 14:04:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:51,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:04:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:51,694 INFO L225 Difference]: With dead ends: 53 [2019-01-08 14:04:51,694 INFO L226 Difference]: Without dead ends: 52 [2019-01-08 14:04:51,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-08 14:04:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-08 14:04:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 14:04:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-08 14:04:51,706 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-08 14:04:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:51,706 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-08 14:04:51,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-08 14:04:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:51,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:51,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:51,707 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-08 14:04:51,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:51,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:51,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:51,831 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-08 14:04:51,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:51,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:51,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:51,831 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-08 14:04:51,832 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:51,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:51,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:51,836 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-08 14:04:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:51,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:51,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:51,837 INFO 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-08 14:04:51,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:51,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:51,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:51,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, 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-08 14:04:51,882 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-08 14:04:51,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,888 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-08 14:04:51,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-08 14:04:51,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,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, 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-08 14:04:51,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,996 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-08 14:04:52,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,029 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-08 14:04:52,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-08 14:04:52,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,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-08 14:04:52,117 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,132 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,165 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,259 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-08 14:04:52,259 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-08 14:04:52,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,286 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-08 14:04:52,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,319 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-08 14:04:52,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-08 14:04:52,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,393 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-08 14:04:52,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,426 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-08 14:04:52,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-08 14:04:52,474 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-08 14:04:52,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:52,497 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-08 14:04:52,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:52,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:52,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:52,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:52,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:52,517 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-08 14:04:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:53,071 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-08 14:04:53,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:53,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:53,073 INFO L225 Difference]: With dead ends: 69 [2019-01-08 14:04:53,073 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 14:04:53,074 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-08 14:04:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 14:04:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-08 14:04:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:04:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-08 14:04:53,085 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-08 14:04:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:53,085 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-08 14:04:53,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-08 14:04:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:53,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:53,086 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 14:04:53,086 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-08 14:04:53,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:53,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:53,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:53,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:53,171 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-08 14:04:53,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:53,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:53,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:53,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:53,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:53,172 INFO 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-08 14:04:53,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:53,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:53,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:53,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:53,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:53,215 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-08 14:04:53,217 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-08 14:04:53,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,222 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-08 14:04:53,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,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, 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-08 14:04:53,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,282 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-08 14:04:53,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,610 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-08 14:04:53,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,652 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-08 14:04:53,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,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, 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-08 14:04:53,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,740 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-08 14:04:53,741 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,756 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,772 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,788 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,820 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-08 14:04:53,820 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-08 14:04:53,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,867 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-08 14:04:53,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,897 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-08 14:04:53,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-08 14:04:53,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,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, 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-08 14:04:53,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,956 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-08 14:04:53,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-08 14:04:53,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,996 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-08 14:04:53,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,031 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-08 14:04:54,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-08 14:04:54,048 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-08 14:04:54,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:54,068 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-08 14:04:54,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:54,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-08 14:04:54,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:54,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:04:54,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:04:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:04:54,088 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-08 14:04:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:54,410 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-08 14:04:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:54,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-08 14:04:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:54,412 INFO L225 Difference]: With dead ends: 73 [2019-01-08 14:04:54,412 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 14:04:54,413 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-08 14:04:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 14:04:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-08 14:04:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-08 14:04:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-08 14:04:54,424 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-08 14:04:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:54,425 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-08 14:04:54,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:04:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-08 14:04:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:54,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:54,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:54,426 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-08 14:04:54,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:54,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:54,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:54,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:54,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:54,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:54,533 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-08 14:04:54,535 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:54,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:54,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:54,539 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-08 14:04:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:54,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:54,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:54,539 INFO 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-08 14:04:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:54,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:54,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:54,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:54,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:54,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-08 14:04:54,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,664 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-08 14:04:54,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-08 14:04:54,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-08 14:04:54,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:54,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,919 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-08 14:04:54,919 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,933 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,989 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-08 14:04:54,990 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:04:55,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,032 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-08 14:04:55,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,059 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-08 14:04:55,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:04:55,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,088 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-08 14:04:55,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,115 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-08 14:04:55,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-08 14:04:55,184 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-08 14:04:55,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:55,202 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-08 14:04:55,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:55,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:55,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:55,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:55,222 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-08 14:04:55,667 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-08 14:04:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:55,875 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-08 14:04:55,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:55,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:55,877 INFO L225 Difference]: With dead ends: 84 [2019-01-08 14:04:55,877 INFO L226 Difference]: Without dead ends: 78 [2019-01-08 14:04:55,878 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-08 14:04:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-08 14:04:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-08 14:04:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-08 14:04:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-08 14:04:55,894 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-08 14:04:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:55,894 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-08 14:04:55,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-08 14:04:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:55,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:55,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:55,896 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:55,896 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-08 14:04:55,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:55,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:55,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:55,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:55,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:55,995 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-08 14:04:55,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:55,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:55,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:55,996 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-08 14:04:55,998 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:55,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:56,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:56,002 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-08 14:04:56,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:56,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:56,002 INFO 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-08 14:04:56,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:56,031 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-08 14:04:56,035 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-08 14:04:56,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-08 14:04:56,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,048 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-08 14:04:56,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, 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-08 14:04:56,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:56,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:56,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,211 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-08 14:04:56,212 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,222 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,232 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,255 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-08 14:04:56,256 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-08 14:04:56,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,353 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-08 14:04:56,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:04:56,445 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-08 14:04:56,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-08 14:04:56,935 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-08 14:04:56,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,235 INFO L303 Elim1Store]: Index analysis took 296 ms [2019-01-08 14:04:57,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:04:57,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-08 14:04:58,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,469 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:58,470 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-08 14:04:58,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,586 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-08 14:04:58,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-08 14:04:58,855 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-08 14:04:58,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:58,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, 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-08 14:04:58,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,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, 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-08 14:04:59,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,090 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:59,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:04:59,092 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,183 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:59,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, 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-08 14:04:59,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,258 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-08 14:04:59,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-08 14:04:59,381 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-08 14:04:59,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:59,450 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-08 14:04:59,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:59,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:59,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:59,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:59,471 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-08 14:04:59,814 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-08 14:05:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:00,512 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-08 14:05:00,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:05:00,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:05:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:00,514 INFO L225 Difference]: With dead ends: 109 [2019-01-08 14:05:00,514 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 14:05:00,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:05:00,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 14:05:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-08 14:05:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:05:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-08 14:05:00,534 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-08 14:05:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:00,534 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-08 14:05:00,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-08 14:05:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:00,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:00,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:00,535 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:00,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-08 14:05:00,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:00,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:00,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:00,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:00,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:00,631 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-08 14:05:00,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:00,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:00,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:00,636 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-08 14:05:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:00,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:00,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,637 INFO 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-08 14:05:00,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:00,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:00,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:00,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:00,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,689 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-08 14:05:00,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,699 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-08 14:05:00,708 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-08 14:05:00,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,784 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-08 14:05:00,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-08 14:05:00,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,841 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-08 14:05:00,841 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,880 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-08 14:05:00,880 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:00,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:05:00,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,993 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-08 14:05:00,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:01,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:01,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,039 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-08 14:05:01,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:05:01,056 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-08 14:05:01,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:01,076 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-08 14:05:01,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:01,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:01,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:01,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:01,098 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-08 14:05:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:01,468 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-08 14:05:01,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:01,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:01,470 INFO L225 Difference]: With dead ends: 77 [2019-01-08 14:05:01,470 INFO L226 Difference]: Without dead ends: 76 [2019-01-08 14:05:01,470 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-08 14:05:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-08 14:05:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-08 14:05:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 14:05:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-08 14:05:01,490 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-08 14:05:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:01,490 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-08 14:05:01,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-08 14:05:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:01,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:01,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:01,492 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-08 14:05:01,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:01,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:01,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:01,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:01,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:01,625 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-08 14:05:01,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:01,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:01,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:01,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:01,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:01,626 INFO 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-08 14:05:01,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:01,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:01,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:01,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:01,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:01,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,672 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-08 14:05:01,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,705 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-08 14:05:01,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,745 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-08 14:05:01,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,796 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-08 14:05:01,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,870 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-08 14:05:01,874 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-08 14:05:01,877 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-08 14:05:01,879 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-08 14:05:01,882 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-08 14:05:01,882 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,907 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,921 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,943 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,973 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-08 14:05:01,974 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:05:02,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:05:02,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,035 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-08 14:05:02,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:05:02,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:02,067 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-08 14:05:02,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,100 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-08 14:05:02,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-08 14:05:02,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,134 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-08 14:05:02,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,166 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-08 14:05:02,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-08 14:05:02,188 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-08 14:05:02,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:02,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:02,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:02,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:02,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:02,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:02,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:02,258 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-08 14:05:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:02,785 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-08 14:05:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:02,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:05:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:02,788 INFO L225 Difference]: With dead ends: 88 [2019-01-08 14:05:02,789 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 14:05:02,789 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-08 14:05:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 14:05:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-08 14:05:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:05:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-08 14:05:02,809 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-08 14:05:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:02,809 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-08 14:05:02,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-08 14:05:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:02,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:02,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:02,810 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:02,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-08 14:05:02,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:02,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:02,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:03,145 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-08 14:05:03,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:03,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:03,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:03,146 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-08 14:05:03,147 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:03,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:03,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:03,151 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-08 14:05:03,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:03,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:03,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:03,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:03,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:03,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:03,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:03,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:03,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-08 14:05:03,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,258 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-08 14:05:03,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,266 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-08 14:05:03,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, 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-08 14:05:03,277 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:03,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,359 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-08 14:05:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,396 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-08 14:05:03,397 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,405 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,413 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,432 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-08 14:05:03,432 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-08 14:05:03,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,462 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-08 14:05:03,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,471 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-08 14:05:03,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:05:03,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,493 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-08 14:05:03,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,507 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-08 14:05:03,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-08 14:05:03,522 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-08 14:05:03,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:03,541 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-08 14:05:03,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:03,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:03,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:03,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:03,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:03,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:03,560 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-08 14:05:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:03,811 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-08 14:05:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:03,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:03,813 INFO L225 Difference]: With dead ends: 81 [2019-01-08 14:05:03,813 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:05:03,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:05:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-08 14:05:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:05:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-08 14:05:03,828 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-08 14:05:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:03,828 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-08 14:05:03,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-08 14:05:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:03,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:03,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:03,829 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:03,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:03,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-08 14:05:03,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:03,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:03,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:03,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:03,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:04,000 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-08 14:05:04,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:04,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:04,001 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:04,001 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-08 14:05:04,002 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:04,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:04,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:04,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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:04,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:04,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:04,007 INFO 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-08 14:05:04,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:04,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:04,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:04,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-08 14:05:04,183 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-08 14:05:04,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:04,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,225 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-08 14:05:04,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:05:04,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:04,265 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-08 14:05:04,267 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-08 14:05:04,272 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-08 14:05:04,273 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,288 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,312 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,342 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-08 14:05:04,342 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,386 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-08 14:05:04,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,403 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-08 14:05:04,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:04,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:04,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,454 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-08 14:05:04,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:05:04,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,483 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:04,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:04,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,508 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-08 14:05:04,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:05:04,538 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-08 14:05:04,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:04,587 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-08 14:05:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:04,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:04,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:04,608 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-08 14:05:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:05,073 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-08 14:05:05,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:05,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:05:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:05,075 INFO L225 Difference]: With dead ends: 113 [2019-01-08 14:05:05,076 INFO L226 Difference]: Without dead ends: 112 [2019-01-08 14:05:05,076 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-08 14:05:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-08 14:05:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-08 14:05:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-08 14:05:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-08 14:05:05,100 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-08 14:05:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:05,100 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-08 14:05:05,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-08 14:05:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:05,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:05,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:05,101 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-08 14:05:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:05,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:05,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:05,191 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-08 14:05:05,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:05,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:05,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:05,192 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-08 14:05:05,193 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:05,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:05,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:05,196 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-08 14:05:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:05,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:05,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:05,197 INFO 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-08 14:05:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:05,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:05,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:05,251 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-08 14:05:05,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:05,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,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-08 14:05:05,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,269 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-08 14:05:05,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:05,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,372 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-08 14:05:05,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,406 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-08 14:05:05,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,441 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-08 14:05:05,441 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,452 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,462 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,483 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-08 14:05:05,484 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:05,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,565 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-08 14:05:05,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:05:05,727 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-08 14:05:05,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-01-08 14:05:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2019-01-08 14:05:05,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,913 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:05,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:05,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:05,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,036 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-08 14:05:06,036 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:96 [2019-01-08 14:05:06,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:06,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,259 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:06,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-08 14:05:06,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,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, 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-08 14:05:06,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,372 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-08 14:05:06,372 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-08 14:05:06,439 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-08 14:05:06,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:06,511 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-08 14:05:06,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:06,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-08 14:05:06,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:06,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:06,533 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-08 14:05:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:07,417 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-08 14:05:07,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:05:07,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:05:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:07,420 INFO L225 Difference]: With dead ends: 137 [2019-01-08 14:05:07,420 INFO L226 Difference]: Without dead ends: 136 [2019-01-08 14:05:07,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-08 14:05:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-08 14:05:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 14:05:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-08 14:05:07,454 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-08 14:05:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:07,454 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-08 14:05:07,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-08 14:05:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:07,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:07,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:07,455 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-08 14:05:07,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:07,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:07,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:07,539 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-08 14:05:07,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:07,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:07,540 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-08 14:05:07,541 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:07,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:07,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:07,544 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-08 14:05:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:07,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:07,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,545 INFO 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-08 14:05:07,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:07,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:07,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:07,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,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, 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-08 14:05:07,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,630 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-08 14:05:07,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,672 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-08 14:05:07,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,722 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-08 14:05:07,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:07,797 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-08 14:05:07,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:07,810 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-08 14:05:07,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:07,813 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,835 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,849 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,870 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,899 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-08 14:05:07,899 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-08 14:05:07,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:05:07,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,964 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-08 14:05:07,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-08 14:05:07,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:07,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, 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-08 14:05:07,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,022 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-08 14:05:08,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-08 14:05:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:08,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:08,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:08,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:08,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:08,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:08,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:08,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:08,112 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-08 14:05:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:08,435 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-08 14:05:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:08,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:08,438 INFO L225 Difference]: With dead ends: 120 [2019-01-08 14:05:08,438 INFO L226 Difference]: Without dead ends: 119 [2019-01-08 14:05:08,439 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-08 14:05:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-08 14:05:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-08 14:05:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-08 14:05:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-08 14:05:08,479 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-08 14:05:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:08,479 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-08 14:05:08,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-08 14:05:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:08,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:08,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:08,480 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-08 14:05:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:08,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:08,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:08,620 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-08 14:05:08,628 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-08 14:05:08,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:08,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:08,629 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:08,629 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-08 14:05:08,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:08,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:08,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:08,638 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-08 14:05:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:08,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:08,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:08,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:08,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:08,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:08,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:08,666 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-08 14:05:08,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,715 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-08 14:05:08,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,722 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-08 14:05:08,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-08 14:05:08,733 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:08,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,836 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-08 14:05:08,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,866 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-08 14:05:08,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,915 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-08 14:05:08,916 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,930 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,944 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,959 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,987 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-08 14:05:08,988 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:09,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,005 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-08 14:05:09,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,032 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-08 14:05:09,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-08 14:05:09,050 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-08 14:05:09,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:09,156 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-08 14:05:09,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:05:09,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:05:09,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:05:09,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:05:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:05:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:05:09,176 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-08 14:05:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:09,323 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-08 14:05:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:05:09,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:05:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:09,325 INFO L225 Difference]: With dead ends: 105 [2019-01-08 14:05:09,325 INFO L226 Difference]: Without dead ends: 104 [2019-01-08 14:05:09,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:05:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-08 14:05:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-08 14:05:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 14:05:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-08 14:05:09,375 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-08 14:05:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:09,375 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-08 14:05:09,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:05:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-08 14:05:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:09,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:09,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:09,376 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-08 14:05:09,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:09,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:09,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:09,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:09,902 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-08 14:05:10,330 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-08 14:05:10,506 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-08 14:05:10,677 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-08 14:05:10,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:10,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:10,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:10,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:10,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:10,678 INFO 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-08 14:05:10,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:05:10,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:05:10,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:05:10,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:10,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:10,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:05:10,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, 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-08 14:05:10,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,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, 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-08 14:05:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,736 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-08 14:05:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:10,743 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,971 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-08 14:05:10,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,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, 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-08 14:05:11,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,029 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-08 14:05:11,030 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,040 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,071 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-08 14:05:11,071 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,134 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-08 14:05:11,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:05:11,293 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-08 14:05:11,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:231 [2019-01-08 14:05:11,438 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-01-08 14:05:11,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2019-01-08 14:05:11,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,566 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:11,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:11,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,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, 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-08 14:05:11,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:11,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,885 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-08 14:05:11,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:197, output treesize:121 [2019-01-08 14:05:11,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,994 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:11,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:11,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,095 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-08 14:05:12,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,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 55 treesize of output 53 [2019-01-08 14:05:12,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,260 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:12,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:12,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,324 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-08 14:05:12,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-08 14:05:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:12,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:12,447 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-08 14:05:12,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:12,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:12,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:12,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:12,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:12,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:12,467 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-08 14:05:12,852 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-08 14:05:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:13,185 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-08 14:05:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:13,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:05:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:13,188 INFO L225 Difference]: With dead ends: 131 [2019-01-08 14:05:13,188 INFO L226 Difference]: Without dead ends: 130 [2019-01-08 14:05:13,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:05:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-08 14:05:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-08 14:05:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:05:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-08 14:05:13,215 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-08 14:05:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:13,215 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-08 14:05:13,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-08 14:05:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:13,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:13,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:13,216 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-08 14:05:13,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:13,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:13,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:13,679 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-08 14:05:13,966 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-08 14:05:13,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:13,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:13,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:13,967 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-08 14:05:13,968 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:13,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:13,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:13,971 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-08 14:05:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:13,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:13,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:13,972 INFO 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-08 14:05:13,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:13,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:13,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:13,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:05:14,002 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-08 14:05:14,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:14,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,017 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-08 14:05:14,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,141 INFO L303 Elim1Store]: Index analysis took 123 ms [2019-01-08 14:05:14,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:14,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-08 14:05:14,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,559 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-08 14:05:14,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,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, 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-08 14:05:14,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,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-08 14:05:14,644 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,684 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,700 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,747 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-08 14:05:14,747 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:14,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-08 14:05:14,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:14,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:05:14,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,859 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:14,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:05:14,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,891 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-08 14:05:14,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-08 14:05:14,910 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-08 14:05:14,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:14,937 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-08 14:05:14,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:14,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:14,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:14,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:14,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:14,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:14,959 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-08 14:05:15,696 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-08 14:05:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:16,044 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-08 14:05:16,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:16,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:16,045 INFO L225 Difference]: With dead ends: 71 [2019-01-08 14:05:16,045 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 14:05:16,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 14:05:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-08 14:05:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-08 14:05:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-08 14:05:16,087 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-08 14:05:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:16,087 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-08 14:05:16,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-08 14:05:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:16,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:16,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:16,088 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-08 14:05:16,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:16,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:16,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:16,304 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-08 14:05:16,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:16,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:16,305 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:16,305 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-08 14:05:16,306 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:16,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:16,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:16,310 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-08 14:05:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:16,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:16,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:16,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:16,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:16,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:16,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:16,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,351 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-08 14:05:16,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,384 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-08 14:05:16,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,414 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-08 14:05:16,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:16,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:16,453 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-08 14:05:16,471 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-08 14:05:16,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:16,511 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,541 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,582 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-08 14:05:16,583 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:16,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,607 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-08 14:05:16,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,626 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-08 14:05:16,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:16,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:16,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,670 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-08 14:05:16,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:05:16,686 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-08 14:05:16,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:16,698 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-08 14:05:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:16,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:16,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:16,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:16,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:16,718 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-08 14:05:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:17,042 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-08 14:05:17,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:17,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:17,043 INFO L225 Difference]: With dead ends: 73 [2019-01-08 14:05:17,043 INFO L226 Difference]: Without dead ends: 72 [2019-01-08 14:05:17,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-08 14:05:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-08 14:05:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:05:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-08 14:05:17,073 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-08 14:05:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:17,073 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-08 14:05:17,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-08 14:05:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:17,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:17,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:17,074 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:17,074 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-08 14:05:17,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:17,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:17,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:17,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:17,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:17,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:17,199 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:17,199 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-08 14:05:17,200 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:17,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:17,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:17,202 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-08 14:05:17,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:17,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:17,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:17,203 INFO 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-08 14:05:17,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:17,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:17,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:17,234 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-08 14:05:17,236 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-08 14:05:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:17,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:17,263 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-08 14:05:17,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,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, 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-08 14:05:17,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,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, 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-08 14:05:17,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,405 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-08 14:05:17,406 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,415 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,424 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,444 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-08 14:05:17,444 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:17,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,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, 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-08 14:05:17,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,501 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-08 14:05:17,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:17,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,524 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:17,525 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-08 14:05:17,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,545 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-08 14:05:17,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-08 14:05:17,562 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-08 14:05:17,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:17,587 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-08 14:05:17,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:17,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-08 14:05:17,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:17,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:05:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:05:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:17,608 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-08 14:05:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:17,835 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-08 14:05:17,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:17,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-08 14:05:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:17,837 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:05:17,837 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 14:05:17,838 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-08 14:05:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 14:05:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-08 14:05:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-08 14:05:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-08 14:05:17,873 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-08 14:05:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:17,873 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-08 14:05:17,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:05:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-08 14:05:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:17,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:17,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:17,874 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:17,875 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-08 14:05:17,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:17,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:17,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:17,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:17,907 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-08 14:05:17,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:05:17,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:05:17,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:05:17,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:05:17,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:05:17,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:05:17,909 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-08 14:05:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:17,998 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-08 14:05:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:05:17,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:05:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:18,000 INFO L225 Difference]: With dead ends: 54 [2019-01-08 14:05:18,000 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 14:05:18,001 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-08 14:05:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 14:05:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-08 14:05:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:05:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-08 14:05:18,036 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-08 14:05:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:18,036 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-08 14:05:18,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:05:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-08 14:05:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:18,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:18,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:18,037 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-08 14:05:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:18,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:18,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:18,259 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-08 14:05:18,464 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-08 14:05:18,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:18,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:18,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:18,465 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-08 14:05:18,466 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:18,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:18,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:18,468 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-08 14:05:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:18,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:18,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:18,469 INFO 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-08 14:05:18,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:18,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:18,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:18,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,508 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-08 14:05:18,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,537 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-08 14:05:18,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,570 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-08 14:05:18,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:18,575 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-08 14:05:18,579 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-08 14:05:18,587 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-08 14:05:18,587 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,603 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,616 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,626 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,656 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-08 14:05:18,656 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-08 14:05:18,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,730 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-08 14:05:18,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:18,788 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-08 14:05:18,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-08 14:05:18,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,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, 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-08 14:05:18,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,838 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-08 14:05:18,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-08 14:05:18,850 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-08 14:05:18,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:18,863 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-08 14:05:18,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:18,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:18,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:18,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:18,884 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-08 14:05:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:19,134 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-08 14:05:19,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:19,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:19,135 INFO L225 Difference]: With dead ends: 83 [2019-01-08 14:05:19,136 INFO L226 Difference]: Without dead ends: 82 [2019-01-08 14:05:19,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-08 14:05:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-08 14:05:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-08 14:05:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-08 14:05:19,186 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-08 14:05:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:19,187 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-08 14:05:19,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-08 14:05:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:19,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:19,187 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:05:19,188 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:19,188 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-08 14:05:19,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:19,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:19,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:19,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:19,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:19,282 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-08 14:05:19,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:19,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:19,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:19,282 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-08 14:05:19,283 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:19,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:19,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:19,287 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-08 14:05:19,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:19,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:19,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:19,287 INFO 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-08 14:05:19,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:19,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:19,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:19,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-08 14:05:19,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,329 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-08 14:05:19,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,367 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-08 14:05:19,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,406 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-08 14:05:19,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:19,414 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-08 14:05:19,417 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-08 14:05:19,423 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-08 14:05:19,423 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,438 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,459 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,487 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-08 14:05:19,487 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-08 14:05:19,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:19,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,521 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-08 14:05:19,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:05:19,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,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 28 treesize of output 40 [2019-01-08 14:05:19,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,556 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-08 14:05:19,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-08 14:05:19,572 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-08 14:05:19,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:19,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:19,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:19,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:19,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:19,612 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-08 14:05:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:20,040 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-08 14:05:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:20,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:20,041 INFO L225 Difference]: With dead ends: 86 [2019-01-08 14:05:20,041 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:05:20,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:05:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-08 14:05:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-08 14:05:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-08 14:05:20,105 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-08 14:05:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:20,105 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-08 14:05:20,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-08 14:05:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:20,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:20,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:20,106 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-08 14:05:20,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:20,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:20,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:20,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:20,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:20,253 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-08 14:05:20,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:20,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:20,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:20,254 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-08 14:05:20,255 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:20,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:20,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:20,258 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-08 14:05:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:20,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:20,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:20,259 INFO 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-08 14:05:20,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:20,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:20,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:20,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,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 48 treesize of output 54 [2019-01-08 14:05:20,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-08 14:05:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-08 14:05:20,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,408 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-08 14:05:20,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,482 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-08 14:05:20,484 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-08 14:05:20,486 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-08 14:05:20,489 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-08 14:05:20,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:20,492 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,515 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,529 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,540 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,550 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,579 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-08 14:05:20,580 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:05:20,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,667 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-08 14:05:20,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,798 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-08 14:05:20,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:05:20,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,835 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-08 14:05:20,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,865 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-08 14:05:20,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-08 14:05:20,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,902 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:20,902 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-08 14:05:20,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,937 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-08 14:05:20,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-08 14:05:20,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-08 14:05:20,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:21,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:21,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:21,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:21,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:21,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:21,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:21,053 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-08 14:05:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:21,578 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-08 14:05:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:21,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:21,580 INFO L225 Difference]: With dead ends: 100 [2019-01-08 14:05:21,580 INFO L226 Difference]: Without dead ends: 99 [2019-01-08 14:05:21,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-08 14:05:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-08 14:05:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-08 14:05:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-08 14:05:21,659 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-08 14:05:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:21,659 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-08 14:05:21,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-08 14:05:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:21,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:21,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:21,660 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:21,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-08 14:05:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:21,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:21,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:21,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:21,728 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-08 14:05:21,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:21,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:21,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:21,729 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-08 14:05:21,730 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:21,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:21,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:21,733 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-08 14:05:21,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:21,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:21,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:21,733 INFO 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-08 14:05:21,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:21,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:21,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:21,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:21,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,782 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-08 14:05:21,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,821 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-08 14:05:21,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,869 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-08 14:05:21,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:21,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:21,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:21,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:21,966 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-08 14:05:21,973 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-08 14:05:21,978 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-08 14:05:21,982 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-08 14:05:21,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:21,986 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,020 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,039 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,067 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,103 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-08 14:05:22,104 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:22,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,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, 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-08 14:05:22,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,170 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-08 14:05:22,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:22,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:22,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,254 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-08 14:05:22,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:05:22,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,295 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:22,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:05:22,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,327 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-08 14:05:22,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:05:22,345 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-08 14:05:22,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:22,381 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-08 14:05:22,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:22,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:22,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:22,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:22,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:22,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:22,402 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-08 14:05:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:22,872 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-08 14:05:22,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:22,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:22,875 INFO L225 Difference]: With dead ends: 104 [2019-01-08 14:05:22,875 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:05:22,875 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-08 14:05:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:05:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-08 14:05:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-08 14:05:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-08 14:05:22,992 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-08 14:05:22,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:22,992 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-08 14:05:22,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-08 14:05:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:22,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:22,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:22,993 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-08 14:05:22,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:22,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:22,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:23,066 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-08 14:05:23,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:23,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:23,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:23,067 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-08 14:05:23,069 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:23,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:23,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:23,072 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-08 14:05:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:23,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:23,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:23,072 INFO 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-08 14:05:23,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:23,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:23,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:23,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,107 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-08 14:05:23,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,136 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-08 14:05:23,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,168 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-08 14:05:23,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,203 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-08 14:05:23,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:23,207 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-08 14:05:23,210 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-08 14:05:23,214 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-08 14:05:23,215 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,247 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,258 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,290 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-08 14:05:23,290 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:23,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:23,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,353 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-08 14:05:23,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:23,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:23,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,400 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-08 14:05:23,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:05:23,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,430 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:23,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:23,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,454 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-08 14:05:23,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:05:23,471 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-08 14:05:23,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:23,509 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-08 14:05:23,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:23,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:23,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:23,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:23,530 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-08 14:05:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:24,105 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-08 14:05:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:24,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:24,107 INFO L225 Difference]: With dead ends: 107 [2019-01-08 14:05:24,107 INFO L226 Difference]: Without dead ends: 106 [2019-01-08 14:05:24,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-08 14:05:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-08 14:05:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-08 14:05:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-08 14:05:24,221 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-08 14:05:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:24,221 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-08 14:05:24,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-08 14:05:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:24,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:24,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:24,222 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-08 14:05:24,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:24,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:24,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:24,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:24,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:24,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:24,289 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-08 14:05:24,291 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:24,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:24,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:24,293 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-08 14:05:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:24,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:24,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:24,294 INFO 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-08 14:05:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:24,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:24,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:24,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:24,317 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-08 14:05:24,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,348 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-08 14:05:24,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:24,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:24,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:24,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,473 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-08 14:05:24,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,508 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-08 14:05:24,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,556 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-08 14:05:24,556 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,569 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,584 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,600 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,628 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-08 14:05:24,628 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:24,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:24,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:24,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:24,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,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-08 14:05:24,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,735 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-08 14:05:24,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:05:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:24,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:24,777 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-08 14:05:24,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:24,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:24,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:24,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:24,798 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-08 14:05:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:25,192 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-08 14:05:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:25,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:25,195 INFO L225 Difference]: With dead ends: 100 [2019-01-08 14:05:25,195 INFO L226 Difference]: Without dead ends: 98 [2019-01-08 14:05:25,195 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-08 14:05:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-08 14:05:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-08 14:05:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 14:05:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-08 14:05:25,321 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-08 14:05:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:25,321 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-08 14:05:25,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-08 14:05:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:25,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:25,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:25,322 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:25,322 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-08 14:05:25,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:25,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:25,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:25,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:25,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:25,549 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-08 14:05:25,563 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-08 14:05:25,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:25,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:25,563 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:25,564 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-08 14:05:25,565 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:25,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:25,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:25,568 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-08 14:05:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:25,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:25,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:25,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:25,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:25,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:25,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:25,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:25,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,634 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-08 14:05:25,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,670 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-08 14:05:25,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:25,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:25,718 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-08 14:05:25,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, 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-08 14:05:25,728 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-08 14:05:25,728 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,745 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,759 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,771 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,804 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-08 14:05:25,804 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:05:25,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:05:26,026 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-08 14:05:26,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-01-08 14:05:26,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2019-01-08 14:05:26,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:26,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,220 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:26,221 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-08 14:05:26,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,292 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:26,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:26,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:26,346 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-08 14:05:26,346 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-01-08 14:05:26,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2019-01-08 14:05:26,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:26,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:26,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 39 treesize of output 53 [2019-01-08 14:05:26,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:26,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:26,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2019-01-08 14:05:26,531 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:26,580 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-08 14:05:26,580 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-08 14:05:26,633 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-08 14:05:26,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:26,691 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-08 14:05:26,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:26,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:26,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:26,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:26,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:26,711 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-08 14:05:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:27,764 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-08 14:05:27,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:27,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:27,767 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:05:27,767 INFO L226 Difference]: Without dead ends: 123 [2019-01-08 14:05:27,768 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-08 14:05:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-08 14:05:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-08 14:05:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 14:05:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-08 14:05:27,888 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-08 14:05:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:27,889 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-08 14:05:27,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-08 14:05:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:27,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:27,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:27,889 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-08 14:05:27,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:27,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:27,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:28,041 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-08 14:05:28,341 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-08 14:05:28,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:28,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:28,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:28,342 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-08 14:05:28,343 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:28,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:28,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:28,346 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-08 14:05:28,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:28,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:28,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:28,347 INFO 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-08 14:05:28,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:28,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:28,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:28,561 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-08 14:05:28,575 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-08 14:05:28,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:28,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,738 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-08 14:05:28,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,767 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-08 14:05:28,767 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,796 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,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, 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-08 14:05:28,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,887 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-08 14:05:28,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,925 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-08 14:05:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,970 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-08 14:05:28,971 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,987 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:29,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:29,019 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:29,049 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-08 14:05:29,050 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:05:29,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,080 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-08 14:05:29,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:29,107 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-08 14:05:29,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:05:29,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,281 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:29,281 INFO L303 Elim1Store]: Index analysis took 150 ms [2019-01-08 14:05:29,282 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-08 14:05:29,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:29,314 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-08 14:05:29,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-08 14:05:29,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:29,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:29,345 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-08 14:05:29,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:29,376 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-08 14:05:29,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:05:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:29,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:29,437 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-08 14:05:29,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:29,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:05:29,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:29,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:05:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:05:29,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:29,457 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-08 14:05:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:29,988 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-08 14:05:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:29,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:05:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:29,990 INFO L225 Difference]: With dead ends: 114 [2019-01-08 14:05:29,990 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 14:05:29,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 14:05:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-08 14:05:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 14:05:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-08 14:05:30,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-08 14:05:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:30,134 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-08 14:05:30,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:05:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-08 14:05:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:30,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:30,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:30,135 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-08 14:05:30,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:30,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:30,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:30,309 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-08 14:05:30,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:30,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:30,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:30,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:30,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:30,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:30,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:30,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:30,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:30,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:30,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:30,343 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-08 14:05:30,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-08 14:05:30,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-08 14:05:30,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,358 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-08 14:05:30,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:30,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,391 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,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, 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-08 14:05:30,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,489 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-08 14:05:30,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:30,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,576 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-08 14:05:30,576 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,592 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,607 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,622 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,652 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-08 14:05:30,653 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-08 14:05:30,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,676 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-08 14:05:30,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,706 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-08 14:05:30,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-08 14:05:30,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,732 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-08 14:05:30,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,764 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-08 14:05:30,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-08 14:05:30,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:30,794 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-08 14:05:30,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,827 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-08 14:05:30,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-08 14:05:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:30,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:30,869 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-08 14:05:30,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:30,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:30,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:30,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:30,890 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-08 14:05:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:31,490 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-08 14:05:31,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:05:31,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:31,492 INFO L225 Difference]: With dead ends: 164 [2019-01-08 14:05:31,493 INFO L226 Difference]: Without dead ends: 163 [2019-01-08 14:05:31,493 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-08 14:05:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-08 14:05:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-08 14:05:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-08 14:05:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-08 14:05:31,732 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-08 14:05:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:31,732 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-08 14:05:31,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-08 14:05:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:31,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:31,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:31,733 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-08 14:05:31,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:31,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:31,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:31,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:31,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:31,781 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-08 14:05:31,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:31,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:31,782 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:31,782 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-08 14:05:31,782 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:31,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:31,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:31,785 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-08 14:05:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:31,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:31,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:31,786 INFO 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-08 14:05:31,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:31,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:31,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:31,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:31,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-08 14:05:31,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,874 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-08 14:05:31,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,919 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-08 14:05:31,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,983 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-08 14:05:31,987 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-08 14:05:31,989 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-08 14:05:31,993 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-08 14:05:31,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:31,997 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,018 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,030 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,040 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,051 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,078 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-08 14:05:32,078 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:32,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,101 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-08 14:05:32,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,128 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-08 14:05:32,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:05:32,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,195 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-08 14:05:32,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:32,332 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-08 14:05:32,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-08 14:05:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:32,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:32,411 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-08 14:05:32,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:32,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:32,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:32,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:32,431 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-08 14:05:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:32,996 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-08 14:05:32,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:32,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:32,999 INFO L225 Difference]: With dead ends: 160 [2019-01-08 14:05:32,999 INFO L226 Difference]: Without dead ends: 159 [2019-01-08 14:05:33,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-08 14:05:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-08 14:05:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-08 14:05:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-08 14:05:33,281 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-08 14:05:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:33,281 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-08 14:05:33,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-08 14:05:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:33,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:33,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:33,282 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-08 14:05:33,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:33,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:33,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:33,376 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-08 14:05:33,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:33,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:33,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:33,376 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-08 14:05:33,377 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:33,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:33,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:33,380 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-08 14:05:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:33,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:33,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:33,381 INFO 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-08 14:05:33,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:33,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:33,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:33,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:05:33,405 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-08 14:05:33,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:33,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,428 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-08 14:05:33,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, 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-08 14:05:33,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:33,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,517 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-08 14:05:33,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,546 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-08 14:05:33,547 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,555 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,564 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,583 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-08 14:05:33,584 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-08 14:05:33,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,619 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-08 14:05:33,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,630 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-08 14:05:33,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:05:33,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:33,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,662 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-08 14:05:33,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-08 14:05:33,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-08 14:05:33,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:33,695 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-08 14:05:33,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:33,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:33,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:33,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:33,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:33,715 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-08 14:05:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:34,469 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-08 14:05:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:34,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:34,471 INFO L225 Difference]: With dead ends: 175 [2019-01-08 14:05:34,472 INFO L226 Difference]: Without dead ends: 174 [2019-01-08 14:05:34,472 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-08 14:05:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-08 14:05:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-08 14:05:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-08 14:05:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-08 14:05:34,747 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-08 14:05:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:34,747 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-08 14:05:34,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-08 14:05:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:34,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:34,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:34,748 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:34,748 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-08 14:05:34,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:34,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:34,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:34,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:34,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:34,839 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-08 14:05:34,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:05:34,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 14:05:34,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:05:34,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:05:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:05:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:05:34,841 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-08 14:05:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:35,228 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-08 14:05:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:05:35,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-08 14:05:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:35,230 INFO L225 Difference]: With dead ends: 185 [2019-01-08 14:05:35,231 INFO L226 Difference]: Without dead ends: 184 [2019-01-08 14:05:35,231 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-08 14:05:35,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-08 14:05:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-08 14:05:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-08 14:05:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-08 14:05:35,481 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-08 14:05:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:35,482 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-08 14:05:35,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:05:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-08 14:05:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:35,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:35,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:35,483 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-08 14:05:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:35,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:35,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-08 14:05:35,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:35,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:35,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:35,534 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-08 14:05:35,534 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:35,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:35,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:35,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-08 14:05:35,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:35,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:35,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:35,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 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-08 14:05:35,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:35,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:35,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:35,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:35,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,575 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-08 14:05:35,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,613 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-08 14:05:35,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,647 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-08 14:05:35,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:35,652 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-08 14:05:35,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-08 14:05:35,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, 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-08 14:05:35,662 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,679 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,691 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,731 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-08 14:05:35,731 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-08 14:05:35,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,761 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-08 14:05:35,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,772 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-08 14:05:35,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:05:35,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,791 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:35,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:35,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,804 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-08 14:05:35,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:05:35,819 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-08 14:05:35,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:35,851 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-08 14:05:35,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:35,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:35,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:35,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:35,871 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-08 14:05:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:36,358 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-08 14:05:36,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:36,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:36,361 INFO L225 Difference]: With dead ends: 142 [2019-01-08 14:05:36,361 INFO L226 Difference]: Without dead ends: 141 [2019-01-08 14:05:36,362 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-08 14:05:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-08 14:05:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-08 14:05:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-08 14:05:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-08 14:05:36,820 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-08 14:05:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:36,820 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-08 14:05:36,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-08 14:05:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:36,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:36,822 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:05:36,822 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-08 14:05:36,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:36,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:36,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:36,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:36,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:37,119 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-08 14:05:37,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:37,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:37,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:37,120 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-08 14:05:37,121 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:37,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:37,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:37,123 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-08 14:05:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:37,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:37,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:37,125 INFO 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-08 14:05:37,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:37,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:37,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:37,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:37,214 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-08 14:05:37,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-08 14:05:37,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,225 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-08 14:05:37,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,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, 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-08 14:05:37,235 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:37,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,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, 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-08 14:05:37,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,423 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-08 14:05:37,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,502 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-08 14:05:37,502 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,529 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,550 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,572 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,610 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-08 14:05:37,611 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:37,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,656 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-08 14:05:37,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:37,773 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-08 14:05:37,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-08 14:05:37,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:37,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,832 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-08 14:05:37,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-08 14:05:37,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:37,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,887 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-08 14:05:37,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:05:37,903 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-08 14:05:37,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:37,926 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-08 14:05:37,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:37,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-08 14:05:37,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:37,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:05:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:05:37,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:37,946 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-08 14:05:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:38,708 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-08 14:05:38,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:38,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:05:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:38,711 INFO L225 Difference]: With dead ends: 219 [2019-01-08 14:05:38,711 INFO L226 Difference]: Without dead ends: 216 [2019-01-08 14:05:38,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-08 14:05:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-08 14:05:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-08 14:05:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-08 14:05:39,035 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-08 14:05:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:39,036 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-08 14:05:39,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:05:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-08 14:05:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:39,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:39,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:39,036 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-08 14:05:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:39,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:39,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:39,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:39,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:39,208 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-08 14:05:39,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:39,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:39,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:39,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:39,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:39,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:39,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:05:39,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:05:39,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:05:39,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:39,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:39,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,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 31 treesize of output 40 [2019-01-08 14:05:39,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,267 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-08 14:05:39,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,299 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-08 14:05:39,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:39,341 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-08 14:05:39,344 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-08 14:05:39,350 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-08 14:05:39,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:39,355 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,386 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,398 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,429 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-08 14:05:39,429 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-08 14:05:39,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:05:39,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:39,616 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-08 14:05:39,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-08 14:05:39,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-01-08 14:05:39,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:39,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:39,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:39,850 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-08 14:05:39,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-08 14:05:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:39,913 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:39,929 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-08 14:05:39,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-08 14:05:40,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,116 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:40,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:40,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,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, 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-08 14:05:40,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,318 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-08 14:05:40,318 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-08 14:05:40,418 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-08 14:05:40,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:40,468 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-08 14:05:40,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:40,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:40,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:40,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:40,488 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-08 14:05:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:41,673 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-08 14:05:41,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:41,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:41,675 INFO L225 Difference]: With dead ends: 218 [2019-01-08 14:05:41,676 INFO L226 Difference]: Without dead ends: 215 [2019-01-08 14:05:41,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:05:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-08 14:05:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-08 14:05:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-08 14:05:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-08 14:05:42,055 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-08 14:05:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:42,056 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-08 14:05:42,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-08 14:05:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:42,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:42,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:42,057 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-08 14:05:42,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:42,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:42,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:42,113 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-08 14:05:42,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:42,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:42,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:42,113 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-08 14:05:42,114 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:42,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:42,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:42,116 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-08 14:05:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:42,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:42,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:42,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:42,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:42,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:42,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:42,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,162 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-08 14:05:42,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-08 14:05:42,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,254 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-08 14:05:42,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,322 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-08 14:05:42,326 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-08 14:05:42,329 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-08 14:05:42,333 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-08 14:05:42,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:42,337 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,686 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,716 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,726 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,736 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,765 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-08 14:05:42,765 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:42,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:05:42,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,818 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-08 14:05:42,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:05:42,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:05:42,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,872 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-08 14:05:42,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-08 14:05:42,890 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-08 14:05:42,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:42,903 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-08 14:05:42,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:42,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:42,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:42,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:42,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:42,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:42,923 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-08 14:05:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:43,766 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-08 14:05:43,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:43,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:43,768 INFO L225 Difference]: With dead ends: 274 [2019-01-08 14:05:43,769 INFO L226 Difference]: Without dead ends: 269 [2019-01-08 14:05:43,769 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-08 14:05:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-08 14:05:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-08 14:05:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-08 14:05:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-08 14:05:44,337 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-08 14:05:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:44,338 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-08 14:05:44,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-08 14:05:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:44,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:44,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:44,339 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:44,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:44,339 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-08 14:05:44,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:44,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:44,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:44,502 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-08 14:05:44,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:44,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:44,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:44,503 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-08 14:05:44,504 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:44,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:44,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:44,508 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-08 14:05:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:44,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:44,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:44,508 INFO 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-08 14:05:44,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:44,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:44,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:44,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, 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-08 14:05:44,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, 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-08 14:05:44,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,536 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-08 14:05:44,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,544 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-08 14:05:44,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:05:44,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-08 14:05:44,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,675 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-08 14:05:44,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:44,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,759 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-08 14:05:44,760 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,774 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,788 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,803 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,831 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-08 14:05:44,832 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:05:44,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,856 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-08 14:05:44,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,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-08 14:05:44,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:05:44,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,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, 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-08 14:05:44,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:45,017 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-08 14:05:45,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-08 14:05:45,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,078 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:45,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:45,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05: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-08 14:05:45,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-08 14:05:45,119 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-08 14:05:45,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:45,140 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-08 14:05:45,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:45,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-08 14:05:45,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:45,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:45,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:45,161 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-08 14:05:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:46,827 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-08 14:05:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:05:46,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:46,833 INFO L225 Difference]: With dead ends: 480 [2019-01-08 14:05:46,833 INFO L226 Difference]: Without dead ends: 477 [2019-01-08 14:05:46,833 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-08 14:05:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-08 14:05:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-08 14:05:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-08 14:05:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-08 14:05:47,758 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-08 14:05:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:47,758 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-08 14:05:47,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-08 14:05:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:47,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:47,760 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-08 14:05:47,760 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-08 14:05:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:47,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:47,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:47,795 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-08 14:05:47,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:47,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:47,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:47,796 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-08 14:05:47,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:47,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:47,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:47,800 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-08 14:05:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:47,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:47,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:47,801 INFO 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-08 14:05:47,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:47,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:47,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:47,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:05:47,832 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-08 14:05:47,840 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-08 14:05:47,857 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-08 14:05:47,882 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-08 14:05:47,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,939 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-08 14:05:47,940 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-08 14:05:47,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,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, 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-08 14:05:47,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-08 14:05:47,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,953 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-08 14:05:47,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-08 14:05:47,959 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-08 14:05:47,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:47,963 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-08 14:05:47,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:05:47,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-08 14:05:47,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:05:47,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:05:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:05:47,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:05:47,983 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-08 14:05:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:50,085 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-08 14:05:50,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:05:50,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-08 14:05:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:50,092 INFO L225 Difference]: With dead ends: 804 [2019-01-08 14:05:50,092 INFO L226 Difference]: Without dead ends: 800 [2019-01-08 14:05:50,093 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-08 14:05:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-08 14:05:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-08 14:05:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-08 14:05:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-08 14:05:52,303 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-08 14:05:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:52,304 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-08 14:05:52,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:05:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-08 14:05:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:52,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:52,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:52,306 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-08 14:05:52,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:52,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:52,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:52,439 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-08 14:05:52,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:52,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:52,439 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:52,439 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-08 14:05:52,440 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:52,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:52,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:52,443 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-08 14:05:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:52,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:52,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:52,444 INFO 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-08 14:05:52,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:52,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:52,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:52,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:52,479 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-08 14:05:52,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,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-08 14:05:52,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,490 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-08 14:05:52,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,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, 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-08 14:05:52,499 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:52,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,672 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-08 14:05:52,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,714 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-08 14:05:52,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,766 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-08 14:05:52,766 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,782 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,797 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,817 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,847 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-08 14:05:52,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,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, 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-08 14:05:52,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:52,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:52,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-08 14:05:52,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:52,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 38 treesize of output 80 [2019-01-08 14:05:52,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,002 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-08 14:05:53,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-08 14:05:53,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,044 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:53,045 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-08 14:05:53,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,078 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-08 14:05:53,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-08 14:05:53,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:53,139 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-08 14:05:53,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,175 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-08 14:05:53,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-08 14:05:53,211 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-08 14:05:53,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:53,285 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-08 14:05:53,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:53,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:53,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:53,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:53,305 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-08 14:05:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:56,022 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-08 14:05:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:56,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:05:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:56,029 INFO L225 Difference]: With dead ends: 821 [2019-01-08 14:05:56,029 INFO L226 Difference]: Without dead ends: 820 [2019-01-08 14:05:56,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-08 14:05:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-08 14:05:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-08 14:05:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-08 14:05:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-08 14:05:58,233 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-08 14:05:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:58,233 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-08 14:05:58,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-08 14:05:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:58,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:58,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:58,236 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-08 14:05:58,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:58,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:58,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:58,272 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-08 14:05:58,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:58,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:58,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:58,273 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-08 14:05:58,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:58,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:58,277 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:58,278 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-08 14:05:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:58,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:58,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:58,278 INFO 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-08 14:05:58,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:58,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:58,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:58,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:58,323 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-08 14:05:58,332 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-08 14:05:58,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,363 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-08 14:05:58,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,405 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-08 14:05:58,407 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-08 14:05:58,413 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-08 14:05:58,422 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-08 14:05:58,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, 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-08 14:05:58,431 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,444 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,454 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,464 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,491 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-08 14:05:58,491 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-08 14:05:58,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:58,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-08 14:05:58,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:58,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,543 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-08 14:05:58,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-08 14:05:58,556 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-08 14:05:58,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:58,574 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-08 14:05:58,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:58,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:58,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:58,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:58,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:58,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:58,595 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-08 14:06:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:00,828 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-08 14:06:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:06:00,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:06:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:00,835 INFO L225 Difference]: With dead ends: 805 [2019-01-08 14:06:00,835 INFO L226 Difference]: Without dead ends: 804 [2019-01-08 14:06:00,836 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-08 14:06:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-08 14:06:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-08 14:06:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-08 14:06:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-08 14:06:02,995 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-08 14:06:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:02,995 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-08 14:06:02,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-08 14:06:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:02,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:02,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:02,997 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:02,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-08 14:06:02,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:02,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:02,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:02,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:03,434 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-08 14:06:03,489 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-08 14:06:03,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:03,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:03,490 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:03,490 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-08 14:06:03,491 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:03,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:03,493 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:03,494 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-08 14:06:03,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:03,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:03,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:03,494 INFO 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-08 14:06:03,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:03,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:03,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:03,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:06:03,519 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-08 14:06:03,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:06:03,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,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, 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-08 14:06:03,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-08 14:06:03,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:06:03,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,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, 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-08 14:06:03,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,736 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-08 14:06:03,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,791 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-08 14:06:03,792 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,807 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,821 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,864 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-08 14:06:03,865 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:06:03,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:06:03,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,929 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-08 14:06:03,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:06:03,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:06:03,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,976 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-08 14:06:03,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:06:03,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,002 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:04,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:06:04,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,026 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-08 14:06:04,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:06:04,045 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-08 14:06:04,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:04,094 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-08 14:06:04,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:04,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:06:04,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:04,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:04,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:04,113 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-08 14:06:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:07,245 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-08 14:06:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:07,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:07,255 INFO L225 Difference]: With dead ends: 1004 [2019-01-08 14:06:07,255 INFO L226 Difference]: Without dead ends: 1003 [2019-01-08 14:06:07,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-08 14:06:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-08 14:06:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-08 14:06:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-08 14:06:09,565 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-08 14:06:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:09,565 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-08 14:06:09,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-08 14:06:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:09,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:09,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:09,568 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-08 14:06:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:09,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:09,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:09,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:09,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:09,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:09,666 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-08 14:06:09,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:09,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:09,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:09,670 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-08 14:06:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:09,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:09,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:09,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:06:09,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:09,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:09,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:09,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:06:09,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,706 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-08 14:06:09,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,734 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-08 14:06:09,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,769 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-08 14:06:09,773 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-08 14:06:09,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, 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-08 14:06:09,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:06:09,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:06:09,789 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,806 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,818 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,858 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-08 14:06:09,858 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-08 14:06:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,888 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-08 14:06:09,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,905 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-08 14:06:09,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-08 14:06:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,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, 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-08 14:06:09,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:06:10,002 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-08 14:06:10,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-08 14:06:10,031 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-08 14:06:10,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:10,047 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-08 14:06:10,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:10,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-08 14:06:10,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:10,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:06:10,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:06:10,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:10,068 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-08 14:06:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:13,734 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-08 14:06:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:13,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-08 14:06:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:13,744 INFO L225 Difference]: With dead ends: 1213 [2019-01-08 14:06:13,744 INFO L226 Difference]: Without dead ends: 1212 [2019-01-08 14:06:13,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-08 14:06:17,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-08 14:06:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-08 14:06:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-08 14:06:17,122 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-08 14:06:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:17,122 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-08 14:06:17,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:06:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-08 14:06:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:17,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:17,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:17,125 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-08 14:06:17,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:17,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:17,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:17,255 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-08 14:06:17,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:17,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:17,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:17,256 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-08 14:06:17,257 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:17,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:17,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:17,259 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-08 14:06:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:17,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:17,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:17,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:06:17,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:17,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:17,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:17,302 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-08 14:06:17,304 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-08 14:06:17,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,309 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-08 14:06:17,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,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, 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-08 14:06:17,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:17,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,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, 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-08 14:06:17,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-08 14:06:17,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,482 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-08 14:06:17,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,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-08 14:06:17,530 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,546 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,562 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,579 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,608 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-08 14:06:17,608 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:06:17,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,641 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-08 14:06:17,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:17,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:06:17,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,737 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:17,737 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-08 14:06:17,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:17,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-08 14:06:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,803 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-08 14:06:17,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,833 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-08 14:06:17,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-08 14:06:17,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:17,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, 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-08 14:06:17,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,916 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-08 14:06:17,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:17,937 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-08 14:06:17,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:17,982 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-08 14:06:18,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:18,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:06:18,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:18,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:06:18,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:06:18,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:18,002 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-08 14:06:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:22,638 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-08 14:06:22,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:06:22,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:06:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:22,654 INFO L225 Difference]: With dead ends: 1577 [2019-01-08 14:06:22,654 INFO L226 Difference]: Without dead ends: 1575 [2019-01-08 14:06:22,655 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-08 14:06:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-08 14:06:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-08 14:06:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-08 14:06:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-08 14:06:24,848 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-08 14:06:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:24,848 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-08 14:06:24,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:06:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-08 14:06:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:24,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:24,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:24,850 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-08 14:06:24,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:24,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:24,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:24,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:24,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:25,009 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-08 14:06:25,213 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-08 14:06:25,233 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-08 14:06:25,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:25,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:25,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:25,233 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-08 14:06:25,234 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:25,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:25,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:25,236 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-08 14:06:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:25,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:25,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:25,236 INFO 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-08 14:06:25,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:25,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:25,269 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-08 14:06:25,272 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-08 14:06:25,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,277 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-08 14:06:25,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-08 14:06:25,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:06:25,290 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,334 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,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 31 treesize of output 40 [2019-01-08 14:06:25,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:06:25,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,423 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-08 14:06:25,424 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,433 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,441 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,461 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-08 14:06:25,461 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-08 14:06:25,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:06:25,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,518 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-08 14:06:25,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:06:25,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,541 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:25,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, 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-08 14:06:25,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,560 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-08 14:06:25,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-08 14:06:25,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:06:25,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,607 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-08 14:06:25,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-08 14:06:25,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,633 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:25,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 35 treesize of output 75 [2019-01-08 14:06:25,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,662 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-08 14:06:25,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-08 14:06:25,678 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-08 14:06:25,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:25,725 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-08 14:06:25,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:25,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:06:25,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:25,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:06:25,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:06:25,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:06:25,746 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-08 14:06:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:30,293 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-08 14:06:30,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:30,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:06:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:30,300 INFO L225 Difference]: With dead ends: 1108 [2019-01-08 14:06:30,300 INFO L226 Difference]: Without dead ends: 1107 [2019-01-08 14:06:30,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:06:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-08 14:06:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-08 14:06:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-08 14:06:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-08 14:06:33,305 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-08 14:06:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:33,305 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-08 14:06:33,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:06:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-08 14:06:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:33,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:33,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:33,308 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-08 14:06:33,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:33,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:33,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:33,392 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-08 14:06:33,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:33,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:33,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:33,393 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-08 14:06:33,394 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:33,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:33,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:33,397 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-08 14:06:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:33,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:33,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:33,397 INFO 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-08 14:06:33,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:33,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:33,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:33,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:06:33,423 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-08 14:06:33,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,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-08 14:06:33,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,446 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-08 14:06:33,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:06:33,460 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,487 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:06:33,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,557 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-08 14:06:33,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,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-08 14:06:33,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,674 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-08 14:06:33,675 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,720 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,747 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-08 14:06:33,747 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:06:33,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,774 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-08 14:06:33,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:33,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:06:33,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,840 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:33,846 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-08 14:06:33,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:06:33,940 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-08 14:06:33,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-08 14:06:33,972 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-08 14:06:33,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:33,993 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-08 14:06:34,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:34,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:06:34,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:34,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:34,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:34,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:34,014 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-08 14:06:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:37,189 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-08 14:06:37,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:37,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:06:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:37,194 INFO L225 Difference]: With dead ends: 1075 [2019-01-08 14:06:37,195 INFO L226 Difference]: Without dead ends: 1074 [2019-01-08 14:06:37,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-08 14:06:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-08 14:06:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-08 14:06:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-08 14:06:40,201 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-08 14:06:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:40,201 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-08 14:06:40,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-08 14:06:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:40,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:40,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:40,203 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-08 14:06:40,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:40,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:40,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:40,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:40,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:40,303 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-08 14:06:40,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:40,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:40,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:40,304 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-08 14:06:40,305 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:40,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:40,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:40,307 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-08 14:06:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:40,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:40,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:40,308 INFO 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-08 14:06:40,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:40,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:40,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:40,340 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-08 14:06:40,343 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-08 14:06:40,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,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, 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-08 14:06:40,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,361 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-08 14:06:40,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:06:40,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,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 48 treesize of output 54 [2019-01-08 14:06:40,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:06:40,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,536 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-08 14:06:40,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,582 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-08 14:06:40,582 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,598 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,613 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,656 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-08 14:06:40,657 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:06:40,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,684 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-08 14:06:40,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,713 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-08 14:06:40,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:06:40,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,900 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:40,901 INFO L303 Elim1Store]: Index analysis took 166 ms [2019-01-08 14:06:40,902 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-08 14:06:40,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:41,073 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-08 14:06:41,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-08 14:06:41,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,125 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-08 14:06:41,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:41,158 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-08 14:06:41,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-08 14:06:41,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:41,193 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:41,194 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-08 14:06:41,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:41,227 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-08 14:06:41,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-08 14:06:41,252 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-08 14:06:41,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:41,304 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-08 14:06:41,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:41,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:06:41,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:41,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:06:41,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:06:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:41,323 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-08 14:06:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:46,191 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-08 14:06:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:46,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:06:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:46,200 INFO L225 Difference]: With dead ends: 1522 [2019-01-08 14:06:46,200 INFO L226 Difference]: Without dead ends: 1521 [2019-01-08 14:06:46,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:06:46,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-08 14:06:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-08 14:06:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-08 14:06:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-08 14:06:49,526 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-08 14:06:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:49,526 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-08 14:06:49,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:06:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-08 14:06:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:49,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:49,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:49,530 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-08 14:06:49,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:49,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:49,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:49,572 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-08 14:06:49,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:49,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:49,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:49,573 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-08 14:06:49,574 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:49,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:49,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:49,576 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-08 14:06:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:49,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:49,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:49,577 INFO 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-08 14:06:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:49,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:49,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:49,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:06:49,599 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-08 14:06:49,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, 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-08 14:06:49,619 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-08 14:06:49,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:06:49,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:49,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:49,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:49,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:49,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:49,692 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-08 14:06:49,692 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-08 14:06:49,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-08 14:06:49,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:49,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:49,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-08 14:06:49,703 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-08 14:06:49,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:49,720 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-08 14:06:49,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:06:49,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:06:49,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:06:49,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:06:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:06:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:06:49,739 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-08 14:06:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:54,151 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-08 14:06:54,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:06:54,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-08 14:06:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:54,160 INFO L225 Difference]: With dead ends: 1559 [2019-01-08 14:06:54,160 INFO L226 Difference]: Without dead ends: 1554 [2019-01-08 14:06:54,161 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-08 14:06:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-08 14:06:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-08 14:06:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-08 14:06:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-08 14:06:58,677 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-08 14:06:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:58,677 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-08 14:06:58,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:06:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-08 14:06:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:58,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:58,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:58,679 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-08 14:06:58,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:58,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:58,735 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-08 14:06:58,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:58,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:58,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:58,736 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-08 14:06:58,737 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:58,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:58,739 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:58,739 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-08 14:06:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:58,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:58,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:58,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:06:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:58,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:58,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:58,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 18 treesize of output 21 [2019-01-08 14:06:58,814 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-08 14:06:58,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,819 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-08 14:06:58,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,826 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-08 14:06:58,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:06:58,836 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,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 43 treesize of output 39 [2019-01-08 14:06:58,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-08 14:06:59,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:06:59,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,087 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-08 14:06:59,088 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,106 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,120 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,135 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,162 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-08 14:06:59,162 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:06:59,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:06:59,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,215 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-08 14:06:59,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:06:59,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:06:59,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:06:59,367 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-08 14:06:59,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-08 14:06:59,416 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-08 14:06:59,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:59,430 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-08 14:06:59,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:59,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:06:59,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:59,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:59,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:06:59,450 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-08 14:07:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:04,265 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-08 14:07:04,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:04,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:07:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:04,270 INFO L225 Difference]: With dead ends: 1574 [2019-01-08 14:07:04,270 INFO L226 Difference]: Without dead ends: 1570 [2019-01-08 14:07:04,271 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-08 14:07:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-08 14:07:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-08 14:07:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-08 14:07:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-08 14:07:08,951 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-08 14:07:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:08,951 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-08 14:07:08,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:07:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-08 14:07:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:07:08,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:08,953 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-08 14:07:08,954 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-08 14:07:08,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:08,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:08,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:08,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:09,413 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-08 14:07:09,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:09,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:09,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:09,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:09,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:09,414 INFO 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-08 14:07:09,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:07:09,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:07:09,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:07:09,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:07:09,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:09,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:07:09,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:07:09,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,443 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-08 14:07:09,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:07:09,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:07:09,470 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,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-08 14:07:09,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,569 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-08 14:07:09,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,602 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-08 14:07:09,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,647 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-08 14:07:09,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,661 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,691 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,719 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-08 14:07:09,720 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:07:09,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,745 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-08 14:07:09,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,772 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-08 14:07:09,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-08 14:07:09,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,812 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-08 14:07:09,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:07:09,913 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-08 14:07:09,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-08 14:07:09,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,967 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:09,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:07:09,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,993 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-08 14:07:09,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-08 14:07:10,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,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, 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-08 14:07:10,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,048 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-08 14:07:10,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-08 14:07:10,067 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-08 14:07:10,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:10,114 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-08 14:07:10,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:07:10,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:10,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:07:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:07:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:10,135 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-08 14:07:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:16,717 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-08 14:07:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:07:16,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:07:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:16,722 INFO L225 Difference]: With dead ends: 2098 [2019-01-08 14:07:16,722 INFO L226 Difference]: Without dead ends: 2091 [2019-01-08 14:07:16,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:07:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-08 14:07:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-08 14:07:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-08 14:07:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-08 14:07:22,257 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-08 14:07:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:22,258 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-08 14:07:22,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:07:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-08 14:07:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:07:22,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:22,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:22,261 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-08 14:07:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:22,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:07:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:22,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:22,308 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-08 14:07:22,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:22,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:22,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:07:22,309 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-08 14:07:22,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:22,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:22,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:22,312 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-08 14:07:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:22,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:22,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:22,313 INFO 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-08 14:07:22,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:22,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:22,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:22,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 18 treesize of output 21 [2019-01-08 14:07:22,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:07:22,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,348 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-08 14:07:22,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:07:22,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:07:22,453 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:07:22,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,552 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-08 14:07:22,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,589 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-08 14:07:22,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,642 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-08 14:07:22,642 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,658 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,687 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,715 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-08 14:07:22,715 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:07:22,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,749 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-08 14:07:22,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,767 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-08 14:07:22,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:07:22,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,791 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:22,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:07:22,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:22,837 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-08 14:07:22,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-08 14:07:22,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-08 14:07:22,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:22,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:22,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:07:22,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:22,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:07:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:07:22,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:07:22,893 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-08 14:07:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:28,323 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-08 14:07:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:07:28,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:07:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:28,328 INFO L225 Difference]: With dead ends: 1846 [2019-01-08 14:07:28,328 INFO L226 Difference]: Without dead ends: 1839 [2019-01-08 14:07:28,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-08 14:07:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-08 14:07:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-08 14:07:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-08 14:07:33,814 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-08 14:07:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:33,815 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-08 14:07:33,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:07:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-08 14:07:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:07:33,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:33,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:33,818 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:33,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-08 14:07:33,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:33,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:33,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:33,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:33,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:33,947 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-08 14:07:33,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:33,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:33,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:07:33,948 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-08 14:07:33,949 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:33,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:33,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:33,952 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-08 14:07:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:33,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:33,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:33,952 INFO 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-08 14:07:33,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:33,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:33,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:33,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:07:33,979 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-08 14:07:33,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:33,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:33,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:07:33,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:33,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:33,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:33,992 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-08 14:07:33,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:33,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:33,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:07:34,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:07:34,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,100 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-08 14:07:34,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,136 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-08 14:07:34,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-08 14:07:34,188 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,203 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,233 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,261 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-08 14:07:34,262 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:07:34,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,302 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-08 14:07:34,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:07:34,398 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-08 14:07:34,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-08 14:07:34,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:07:34,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,564 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-08 14:07:34,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,609 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-08 14:07:34,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-08 14:07:34,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:34,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:07:34,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,789 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:34,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,791 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-08 14:07:34,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,849 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-08 14:07:34,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-08 14:07:35,818 WARN L181 SmtUtils]: Spent 941.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-08 14:07:35,823 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-08 14:07:35,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:35,898 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-08 14:07:35,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:35,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-08 14:07:35,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:35,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:07:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:07:35,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:07:35,917 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-08 14:07:36,129 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-08 14:07:38,100 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-08 14:07:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:43,581 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-08 14:07:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:07:43,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:07:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:43,587 INFO L225 Difference]: With dead ends: 2193 [2019-01-08 14:07:43,587 INFO L226 Difference]: Without dead ends: 2192 [2019-01-08 14:07:43,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:07:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-08 14:07:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-08 14:07:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-08 14:07:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-08 14:07:49,465 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-08 14:07:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:49,465 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-08 14:07:49,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:07:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-08 14:07:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:07:49,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:49,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:49,468 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-08 14:07:49,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:49,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:49,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:49,624 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-08 14:07:49,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:49,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:49,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:49,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:49,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:49,624 INFO 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-08 14:07:49,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:07:49,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:07:49,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:07:49,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:07:49,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:49,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,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-08 14:07:49,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,692 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-08 14:07:49,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,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, 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-08 14:07:49,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,783 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-08 14:07:49,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,818 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,860 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-08 14:07:49,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:07:49,900 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-08 14:07:49,917 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-08 14:07:49,934 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-08 14:07:49,935 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,016 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,030 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,076 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,084 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,113 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-08 14:07:50,114 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:07:50,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,144 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-08 14:07:50,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:50,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:07:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,206 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-08 14:07:50,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,241 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-08 14:07:50,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-08 14:07:50,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,305 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:50,306 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-08 14:07:50,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,339 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-08 14:07:50,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-08 14:07:50,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:50,375 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:50,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, 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-08 14:07:50,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:50,407 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-08 14:07:50,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-08 14:07:50,441 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-08 14:07:50,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:50,490 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-08 14:07:50,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:50,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:07:50,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:50,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:07:50,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:07:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:50,510 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-08 14:07:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:58,355 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-08 14:07:58,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:07:58,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:07:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:58,362 INFO L225 Difference]: With dead ends: 2526 [2019-01-08 14:07:58,362 INFO L226 Difference]: Without dead ends: 2520 [2019-01-08 14:07:58,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:07:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-08 14:08:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-08 14:08:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-08 14:08:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-08 14:08:04,437 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-08 14:08:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:04,437 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-08 14:08:04,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:08:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-08 14:08:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:08:04,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:04,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:04,441 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-08 14:08:04,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:04,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:04,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:08:04,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:04,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:04,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-08 14:08:04,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:04,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:04,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:08:04,534 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-08 14:08:04,535 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:04,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:04,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:04,541 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-08 14:08:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:04,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:04,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:04,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:08:04,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:04,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:04,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:04,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:08:04,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, 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-08 14:08:04,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,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, 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-08 14:08:04,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:08:04,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:08:04,605 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:08:04,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,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-08 14:08:04,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:08:04,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,794 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-08 14:08:04,794 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,809 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,825 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,841 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,869 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-08 14:08:04,869 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:08:04,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,906 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-08 14:08:04,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:08:04,999 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-08 14:08:05,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-08 14:08:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:05,040 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:05,041 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-08 14:08:05,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:05,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-08 14:08:05,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-08 14:08:05,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-08 14:08:05,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:05,186 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-08 14:08:05,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:05,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-08 14:08:05,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:08:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:08:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:08:05,205 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-08 14:08:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:11,334 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-08 14:08:11,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:08:11,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-08 14:08:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:11,339 INFO L225 Difference]: With dead ends: 1971 [2019-01-08 14:08:11,340 INFO L226 Difference]: Without dead ends: 1964 [2019-01-08 14:08:11,340 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-08 14:08:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-08 14:08:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-08 14:08:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-08 14:08:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-08 14:08:17,525 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-08 14:08:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:17,525 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-08 14:08:17,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:08:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-08 14:08:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:08:17,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:17,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:17,529 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:17,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-08 14:08:17,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:17,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:17,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:17,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:17,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:17,649 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-08 14:08:17,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:17,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:17,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:08:17,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:08:17,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:17,649 INFO 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-08 14:08:17,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:08:17,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:08:17,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:08:17,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:08:17,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:17,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:08:17,671 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-08 14:08:17,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,677 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-08 14:08:17,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,685 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-08 14:08:17,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,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 27 treesize of output 62 [2019-01-08 14:08:17,695 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:08:17,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,794 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-08 14:08:17,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,830 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-08 14:08:17,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,875 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-08 14:08:17,876 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,905 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,921 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:17,948 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-08 14:08:17,949 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:08:17,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:17,993 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-08 14:08:17,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,012 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-08 14:08:18,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:08:18,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:08:18,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,059 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-08 14:08:18,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:08:18,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,090 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:18,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:08:18,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,116 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-08 14:08:18,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:08:18,135 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-08 14:08:18,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:18,173 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-08 14:08:18,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:18,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:08:18,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:18,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:08:18,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:08:18,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:08:18,192 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-08 14:08:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:24,461 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-08 14:08:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:08:24,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-08 14:08:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:24,467 INFO L225 Difference]: With dead ends: 2036 [2019-01-08 14:08:24,467 INFO L226 Difference]: Without dead ends: 2033 [2019-01-08 14:08:24,467 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-08 14:08:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-08 14:08:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-08 14:08:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-08 14:08:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-08 14:08:30,637 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-08 14:08:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:30,637 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-08 14:08:30,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:08:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-08 14:08:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:08:30,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:30,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:30,640 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-08 14:08:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:30,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:08:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:30,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:30,718 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-08 14:08:30,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:30,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:30,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:08:30,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:08:30,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:30,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 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-08 14:08:30,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:08:30,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:08:30,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:08:30,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:08:30,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:30,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, 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-08 14:08:30,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:30,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:30,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:08:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:30,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:30,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:30,817 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-08 14:08:30,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:08:30,881 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-08 14:08:30,883 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-08 14:08:30,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-08 14:08:30,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, 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-08 14:08:30,891 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,909 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,923 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,934 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:30,965 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-08 14:08:30,966 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-08 14:08:30,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,005 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-08 14:08:31,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:08:31,075 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-08 14:08:31,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-08 14:08:31,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,162 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-08 14:08:31,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-08 14:08:31,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,334 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:31,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:08:31,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:31,421 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-08 14:08:31,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-08 14:08:31,541 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-08 14:08:31,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:08:31,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:31,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,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, 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-08 14:08:31,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:31,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,724 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:31,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:08:31,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:31,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,803 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:31,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:08:31,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:31,872 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-08 14:08:31,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-08 14:08:31,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:31,941 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:31,942 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-08 14:08:31,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:32,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,023 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-08 14:08:32,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:32,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,102 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:32,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,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, 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-08 14:08:32,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:32,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:32,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:08:32,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:32,253 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-08 14:08:32,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-08 14:08:32,346 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-08 14:08:32,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:32,495 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-08 14:08:32,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:32,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:08:32,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:32,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:08:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:08:32,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:08:32,515 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-08 14:08:35,187 WARN L181 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-08 14:08:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:43,224 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-08 14:08:43,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:08:43,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:08:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:43,232 INFO L225 Difference]: With dead ends: 2952 [2019-01-08 14:08:43,233 INFO L226 Difference]: Without dead ends: 2951 [2019-01-08 14:08:43,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:08:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-08 14:08:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-08 14:08:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-08 14:08:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-08 14:08:48,753 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-08 14:08:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:48,753 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-08 14:08:48,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:08:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-08 14:08:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:08:48,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:48,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:48,756 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-08 14:08:48,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:48,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:08:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:48,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:48,961 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-08 14:08:49,052 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-08 14:08:49,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:49,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:49,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:08:49,053 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-08 14:08:49,054 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:49,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:49,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:49,056 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-08 14:08:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:49,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:49,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:49,057 INFO 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-08 14:08:49,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:49,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:49,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:08:49,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,092 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-08 14:08:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-08 14:08:49,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-08 14:08:49,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:08:49,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:08:49,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:08:49,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:08:49,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:08:49,253 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,276 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,289 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,299 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,336 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-08 14:08:49,337 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:08:49,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,371 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-08 14:08:49,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:08:49,496 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-08 14:08:49,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-08 14:08:49,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,568 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:49,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, 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-08 14:08:49,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:49,630 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-08 14:08:49,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:49,689 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-08 14:08:49,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-08 14:08:49,743 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-08 14:08:49,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:49,765 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-08 14:08:49,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:49,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-08 14:08:49,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:49,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:08:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:08:49,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:08:49,786 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-08 14:08:50,139 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-08 14:08:50,311 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-08 14:08:50,667 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-08 14:08:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:56,860 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-08 14:08:56,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:08:56,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:08:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:56,865 INFO L225 Difference]: With dead ends: 1903 [2019-01-08 14:08:56,865 INFO L226 Difference]: Without dead ends: 1896 [2019-01-08 14:08:56,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:08:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-08 14:09:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-08 14:09:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-08 14:09:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-08 14:09:02,999 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-08 14:09:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:02,999 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-08 14:09:02,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-08 14:09:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:09:03,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:03,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:03,002 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:03,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-08 14:09:03,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:03,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:03,142 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-08 14:09:03,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:03,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:03,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:03,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:03,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:03,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:03,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:03,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:03,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:09:03,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:03,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:03,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:09:03,166 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-08 14:09:03,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-08 14:09:03,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,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, 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-08 14:09:03,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:09:03,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,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 43 treesize of output 39 [2019-01-08 14:09:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-08 14:09:03,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,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-08 14:09:03,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,376 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-08 14:09:03,376 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,391 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,404 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,420 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,448 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-08 14:09:03,448 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:09:03,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,470 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-08 14:09:03,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,499 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-08 14:09:03,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:09:03,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,555 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:03,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:09:03,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:09:03,654 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-08 14:09:03,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-01-08 14:09:03,712 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-08 14:09:03,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:03,731 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-08 14:09:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:09:03,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:03,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:09:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:09:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:09:03,751 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-08 14:09:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:09,818 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-08 14:09:09,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:09:09,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:09:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:09,822 INFO L225 Difference]: With dead ends: 1884 [2019-01-08 14:09:09,823 INFO L226 Difference]: Without dead ends: 1877 [2019-01-08 14:09:09,823 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-08 14:09:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-08 14:09:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-08 14:09:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-08 14:09:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-08 14:09:16,062 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-08 14:09:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:16,062 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-08 14:09:16,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-08 14:09:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:09:16,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:16,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:16,066 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:16,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-08 14:09:16,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:16,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:16,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:16,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:16,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:16,179 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:09:16,179 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-08 14:09:16,180 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:16,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:16,183 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:16,183 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-08 14:09:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:16,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:16,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:16,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:16,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:16,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:16,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:16,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-08 14:09:16,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,225 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-08 14:09:16,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,263 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-08 14:09:16,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,313 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-08 14:09:16,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,391 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-08 14:09:16,393 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-08 14:09:16,397 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-08 14:09:16,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, 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-08 14:09:16,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:09:16,404 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,568 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,629 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-08 14:09:16,629 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:09:16,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,655 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-08 14:09:16,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,681 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-08 14:09:16,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-08 14:09:16,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,777 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-08 14:09:16,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:16,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:16,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-08 14:09:16,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:16,836 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:16,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, 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-08 14:09:16,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:09:16,955 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-08 14:09:16,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-08 14:09:16,988 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-08 14:09:16,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:17,018 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-08 14:09:17,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:17,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-08 14:09:17,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:17,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:09:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:09:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:09:17,038 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-08 14:09:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:26,998 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-08 14:09:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:09:26,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:09:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:27,006 INFO L225 Difference]: With dead ends: 2991 [2019-01-08 14:09:27,006 INFO L226 Difference]: Without dead ends: 2978 [2019-01-08 14:09:27,007 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-08 14:09:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-08 14:09:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-08 14:09:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-08 14:09:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-08 14:09:35,059 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-08 14:09:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:35,059 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-08 14:09:35,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:09:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-08 14:09:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:09:35,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:35,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:35,063 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-08 14:09:35,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:35,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:35,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:35,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:35,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:35,185 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-08 14:09:35,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:35,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:35,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:09:35,186 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-08 14:09:35,187 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:35,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:35,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:35,189 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-08 14:09:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:35,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:35,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:35,190 INFO 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-08 14:09:35,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:35,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:35,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:35,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-08 14:09:35,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,261 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-08 14:09:35,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,299 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-08 14:09:35,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,346 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-08 14:09:35,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,417 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-08 14:09:35,419 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-08 14:09:35,422 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-08 14:09:35,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:09:35,427 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-08 14:09:35,428 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,452 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,476 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,515 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-08 14:09:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,552 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-08 14:09:35,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,578 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-08 14:09:35,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-08 14:09:35,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,616 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-08 14:09:35,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,644 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-08 14:09:35,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-08 14:09:35,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,680 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:35,681 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-08 14:09:35,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,714 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-08 14:09:35,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-08 14:09:35,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,747 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:35,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,749 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-08 14:09:35,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:35,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-08 14:09:35,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:35,823 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:35,824 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-08 14:09:35,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:35,855 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-08 14:09:35,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-08 14:09:35,884 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-08 14:09:35,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:36,066 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-08 14:09:36,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:36,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-08 14:09:36,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:36,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:09:36,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:09:36,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:09:36,086 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-08 14:09:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:47,209 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-08 14:09:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:09:47,210 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-08 14:09:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:47,218 INFO L225 Difference]: With dead ends: 3181 [2019-01-08 14:09:47,218 INFO L226 Difference]: Without dead ends: 3179 [2019-01-08 14:09:47,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-08 14:09:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-08 14:09:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-08 14:09:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-08 14:09:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-08 14:09:55,227 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-08 14:09:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:55,227 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-08 14:09:55,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:09:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-08 14:09:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:09:55,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:55,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:55,231 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-08 14:09:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:55,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:55,299 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-08 14:09:55,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:09:55,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 14:09:55,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:09:55,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:09:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:09:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:09:55,301 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-08 14:10:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:03,234 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-08 14:10:03,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:10:03,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-08 14:10:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:03,240 INFO L225 Difference]: With dead ends: 2346 [2019-01-08 14:10:03,241 INFO L226 Difference]: Without dead ends: 2337 [2019-01-08 14:10:03,242 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-08 14:10:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-08 14:10:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-08 14:10:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-08 14:10:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-08 14:10:11,264 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-08 14:10:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:11,264 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-08 14:10:11,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:10:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-08 14:10:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:11,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:11,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:11,268 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-08 14:10:11,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:11,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:11,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:11,408 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-08 14:10:11,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:11,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:11,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:10:11,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:10:11,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:11,409 INFO 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-08 14:10:11,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:10:11,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:10:11,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:10:11,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:10:11,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:11,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,456 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-08 14:10:11,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,488 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-08 14:10:11,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:11,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,577 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-08 14:10:11,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,651 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-08 14:10:11,653 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-08 14:10:11,655 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-08 14:10:11,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, 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-08 14:10:11,660 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-08 14:10:11,660 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,684 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,748 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-08 14:10:11,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-08 14:10:11,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,819 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-08 14:10:11,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-08 14:10:11,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,858 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-08 14:10:11,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,892 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-08 14:10:11,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-08 14:10:11,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:11,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,929 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-08 14:10:11,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:11,966 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-08 14:10:11,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-08 14:10:11,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:11,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,007 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:12,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:10:12,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:12,047 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-08 14:10:12,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:10:12,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:12,085 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:12,086 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-08 14:10:12,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:12,120 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-08 14:10:12,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-08 14:10:12,146 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-08 14:10:12,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:10:12,235 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-08 14:10:12,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:10:12,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-08 14:10:12,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:10:12,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:10:12,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:10:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:10:12,255 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-08 14:10:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:20,920 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-08 14:10:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:10:20,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-08 14:10:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:20,927 INFO L225 Difference]: With dead ends: 2345 [2019-01-08 14:10:20,927 INFO L226 Difference]: Without dead ends: 2338 [2019-01-08 14:10:20,928 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-08 14:10:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-08 14:10:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-08 14:10:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-08 14:10:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-08 14:10:23,151 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-08 14:10:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:23,151 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-08 14:10:23,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:10:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-08 14:10:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:23,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:23,152 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:23,152 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:23,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-08 14:10:23,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:23,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:10:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:23,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:10:23,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:23,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:23,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:10:23,306 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-08 14:10:23,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:10:23,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:10:23,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:10:23,310 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-08 14:10:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:23,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:10:23,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:23,311 INFO 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-08 14:10:23,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:23,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:10:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:23,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:23,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:23,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, 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-08 14:10:23,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,341 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-08 14:10:23,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,349 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-08 14:10:23,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:23,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:23,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:10:23,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,469 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-08 14:10:23,469 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,478 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,487 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,504 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-08 14:10:23,505 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-08 14:10:23,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,534 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-08 14:10:23,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-08 14:10:23,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,560 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-08 14:10:23,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-08 14:10:23,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,596 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-08 14:10:23,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:10:23,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-08 14:10:23,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:23,636 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-08 14:10:23,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:23,653 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-08 14:10:23,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-08 14:10:23,671 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-08 14:10:23,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:10:23,712 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-08 14:10:23,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:10:23,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:10:23,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:10:23,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:10:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:10:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:10:23,731 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-08 14:10:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:26,178 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-08 14:10:26,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:10:26,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:10:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:26,181 INFO L225 Difference]: With dead ends: 480 [2019-01-08 14:10:26,181 INFO L226 Difference]: Without dead ends: 477 [2019-01-08 14:10:26,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:10:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-08 14:10:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-08 14:10:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-08 14:10:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-08 14:10:27,164 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-08 14:10:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:27,164 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-08 14:10:27,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:10:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-08 14:10:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:27,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:27,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:27,165 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-08 14:10:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:27,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:27,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:27,266 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-08 14:10:27,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:27,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:27,266 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:10:27,266 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-08 14:10:27,267 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:10:27,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:10:27,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:10:27,269 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-08 14:10:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:27,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:10:27,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:27,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:10:27,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:27,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:10:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:27,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:27,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:10:27,288 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-08 14:10:27,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,295 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-08 14:10:27,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,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-08 14:10:27,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:10:27,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:10:27,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,510 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-08 14:10:27,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-08 14:10:27,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,595 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-08 14:10:27,595 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,609 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,623 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,639 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,667 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-08 14:10:27,667 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:10:27,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,703 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-08 14:10:27,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:27,720 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-08 14:10:27,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:10:27,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:27,897 INFO L303 Elim1Store]: Index analysis took 158 ms [2019-01-08 14:10:27,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:27,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:28,034 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-08 14:10:28,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:10:28,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:28,061 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:28,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 33 treesize of output 73 [2019-01-08 14:10:28,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:28,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:10:28,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:10:28,100 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-08 14:10:28,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:10:28,131 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-08 14:10:28,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:10:28,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:10:28,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:10:28,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:10:28,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:10:28,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:10:28,151 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-08 14:10:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:30,098 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-08 14:10:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:10:30,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:10:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:30,100 INFO L225 Difference]: With dead ends: 250 [2019-01-08 14:10:30,100 INFO L226 Difference]: Without dead ends: 243 [2019-01-08 14:10:30,100 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-08 14:10:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-08 14:10:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-08 14:10:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-08 14:10:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-08 14:10:31,689 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-08 14:10:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:31,689 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-08 14:10:31,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:10:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-08 14:10:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:31,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:31,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:31,690 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-08 14:10:31,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:31,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:31,804 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-08 14:10:31,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:31,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:31,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:10:31,805 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-08 14:10:31,805 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:10:31,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:10:31,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:10:31,807 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-08 14:10:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:31,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:10:31,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:31,808 INFO 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-08 14:10:31,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:31,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:10:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:31,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:31,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:31,829 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-08 14:10:31,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,835 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-08 14:10:31,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,842 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-08 14:10:31,851 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-08 14:10:31,851 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,869 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:31,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,933 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-08 14:10:31,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:31,962 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-08 14:10:31,963 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,971 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,980 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:31,999 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-08 14:10:32,000 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-08 14:10:32,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,030 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-08 14:10:32,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:32,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:32,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-08 14:10:32,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,058 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-08 14:10:32,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:32,073 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-08 14:10:32,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-08 14:10:32,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:32,095 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:32,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, 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-08 14:10:32,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:32,112 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-08 14:10:32,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-08 14:10:32,128 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-08 14:10:32,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:10:32,159 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-08 14:10:32,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:10:32,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:10:32,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:10:32,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:10:32,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:10:32,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:10:32,180 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-08 14:10:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:35,613 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-08 14:10:35,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:10:35,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:10:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:35,614 INFO L225 Difference]: With dead ends: 372 [2019-01-08 14:10:35,615 INFO L226 Difference]: Without dead ends: 362 [2019-01-08 14:10:35,615 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-08 14:10:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-08 14:10:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-08 14:10:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-08 14:10:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-08 14:10:38,036 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-08 14:10:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:38,036 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-08 14:10:38,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:10:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-08 14:10:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:38,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:38,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:38,038 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:38,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-08 14:10:38,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:38,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:38,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:38,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:38,103 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-08 14:10:38,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:38,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:38,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:10:38,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:10:38,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:38,104 INFO 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-08 14:10:38,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:10:38,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:10:38,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:10:38,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:10:38,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:38,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:10:38,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:10:38,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,133 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-08 14:10:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,145 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-08 14:10:38,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:10:38,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:38,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,250 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-08 14:10:38,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:38,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,332 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-08 14:10:38,333 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,348 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,362 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,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-08 14:10:38,405 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:10:38,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,430 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-08 14:10:38,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,456 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-08 14:10:38,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:10:38,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,485 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:38,493 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-08 14:10:38,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:10:38,586 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-08 14:10:38,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-08 14:10:38,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:38,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:10:38,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:38,647 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-08 14:10:38,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-08 14:10:38,664 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-08 14:10:38,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:10:38,715 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-08 14:10:38,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:10:38,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:10:38,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:10:38,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:10:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:10:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:10:38,735 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-08 14:10:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:41,777 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-08 14:10:41,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:10:41,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:10:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:41,779 INFO L225 Difference]: With dead ends: 332 [2019-01-08 14:10:41,779 INFO L226 Difference]: Without dead ends: 325 [2019-01-08 14:10:41,779 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-08 14:10:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-08 14:10:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-08 14:10:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-08 14:10:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-08 14:10:44,326 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-08 14:10:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:44,327 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-08 14:10:44,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:10:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-08 14:10:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:44,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:44,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:44,328 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-08 14:10:44,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:44,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:10:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:44,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:44,489 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-08 14:10:44,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:44,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:44,489 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:10:44,490 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-08 14:10:44,490 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:10:44,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:10:44,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:10:44,495 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-08 14:10:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:44,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:10:44,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:44,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:10:44,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:44,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:10:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:44,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:44,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:44,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,529 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-08 14:10:44,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:44,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,612 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-08 14:10:44,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,675 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-08 14:10:44,679 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-08 14:10:44,682 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-08 14:10:44,685 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-08 14:10:44,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:10:44,688 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,709 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,721 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,769 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-08 14:10:44,769 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:10:44,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,819 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-08 14:10:44,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,838 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-08 14:10:44,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:10:44,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,865 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:44,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:44,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,887 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-08 14:10:44,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-08 14:10:44,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:44,914 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:44,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:44,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:44,934 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-08 14:10:44,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-08 14:10:46,660 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-08 14:10:46,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:10:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:10:46,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:10:46,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:10:46,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:10:46,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:10:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:10:46,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:10:46,726 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-08 14:10:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:49,451 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-08 14:10:49,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:10:49,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:10:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:49,453 INFO L225 Difference]: With dead ends: 294 [2019-01-08 14:10:49,453 INFO L226 Difference]: Without dead ends: 287 [2019-01-08 14:10:49,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:10:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-08 14:10:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-08 14:10:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-08 14:10:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-08 14:10:52,011 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-08 14:10:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:52,011 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-08 14:10:52,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:10:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-08 14:10:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:52,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:52,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:52,012 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-08 14:10:52,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:52,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:52,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:52,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:52,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:52,121 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-08 14:10:52,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:52,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:52,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:10:52,122 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-08 14:10:52,123 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:10:52,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:10:52,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:10:52,124 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-08 14:10:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:52,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:10:52,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:52,125 INFO 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-08 14:10:52,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:52,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:10:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:52,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:52,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:10:52,147 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-08 14:10:52,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,177 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-08 14:10:52,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,199 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-08 14:10:52,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,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, 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-08 14:10:52,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:52,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-08 14:10:52,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:52,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,388 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-08 14:10:52,389 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,404 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,418 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,461 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-08 14:10:52,461 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:10:52,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,493 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-08 14:10:52,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,521 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-08 14:10:52,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-08 14:10:52,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,565 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-08 14:10:52,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:10:52,666 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-08 14:10:52,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-08 14:10:52,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,770 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:52,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-01-08 14:10:52,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:52,836 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:10:52,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-08 14:10:52,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:52,888 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-08 14:10:52,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-08 14:10:53,016 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-08 14:10:53,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:10:53,053 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-08 14:10:53,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:10:53,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-08 14:10:53,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:10:53,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:10:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:10:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:10:53,073 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-08 14:10:53,606 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-08 14:10:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:10:56,892 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-08 14:10:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:10:56,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:10:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:10:56,894 INFO L225 Difference]: With dead ends: 364 [2019-01-08 14:10:56,894 INFO L226 Difference]: Without dead ends: 357 [2019-01-08 14:10:56,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:10:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-08 14:10:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-08 14:10:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-08 14:10:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-08 14:10:59,576 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-08 14:10:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:10:59,576 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-08 14:10:59,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:10:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-08 14:10:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:10:59,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:10:59,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:10:59,578 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:10:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-08 14:10:59,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:10:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:59,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:10:59,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:10:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:59,668 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-08 14:10:59,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:59,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:10:59,669 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:10:59,669 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-08 14:10:59,670 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:10:59,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:10:59,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:10:59,672 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-08 14:10:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:10:59,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:10:59,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:10:59,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:10:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:10:59,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:10:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:10:59,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:10:59,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-08 14:10:59,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-08 14:10:59,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,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-08 14:10:59,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,710 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-08 14:10:59,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:10:59,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:10:59,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,820 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-08 14:10:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:10:59,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:10:59,900 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-08 14:10:59,900 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,915 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,929 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,945 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:10:59,973 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-08 14:10:59,973 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:11:00,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,017 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-08 14:11:00,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:00,036 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-08 14:11:00,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:11:00,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:11:00,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:00,085 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-08 14:11:00,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:11:00,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:00,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:11:00,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 33 treesize of output 77 [2019-01-08 14:11:00,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:00,134 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-08 14:11:00,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:11:00,153 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-08 14:11:00,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:11:00,187 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-08 14:11:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:11:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:11:00,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:11:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:11:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:11:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:11:00,206 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-08 14:11:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:11:03,489 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-08 14:11:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:11:03,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:11:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:11:03,491 INFO L225 Difference]: With dead ends: 319 [2019-01-08 14:11:03,491 INFO L226 Difference]: Without dead ends: 312 [2019-01-08 14:11:03,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:11:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-08 14:11:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-08 14:11:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-08 14:11:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-08 14:11:06,555 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-08 14:11:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:11:06,556 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-08 14:11:06,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:11:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-08 14:11:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:11:06,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:11:06,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:11:06,557 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:11:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-08 14:11:06,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:11:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:06,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:11:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:06,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:11:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:06,676 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-08 14:11:06,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:06,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:11:06,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:11:06,677 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-08 14:11:06,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:11:06,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:11:06,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:11:06,680 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-08 14:11:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:06,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:11:06,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:06,680 INFO 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-08 14:11:06,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:11:06,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:11:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:06,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:11:06,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:11:06,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,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, 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-08 14:11:06,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,755 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-08 14:11:06,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:06,802 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-08 14:11:06,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,878 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-08 14:11:06,882 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-08 14:11:06,885 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-08 14:11:06,888 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-08 14:11:06,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:11:06,892 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,912 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,924 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,942 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:06,968 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-08 14:11:06,969 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:11:06,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,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, 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-08 14:11:07,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:11:07,095 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-08 14:11:07,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-08 14:11:07,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-08 14:11:07,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:07,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,246 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-08 14:11:07,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:07,295 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-08 14:11:07,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-08 14:11:07,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:11:07,351 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-08 14:11:07,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:11:07,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:07,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:11:07,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:07,451 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-08 14:11:07,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-08 14:11:07,557 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-08 14:11:07,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:11:07,593 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-08 14:11:07,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:11:07,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-08 14:11:07,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:11:07,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:11:07,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:11:07,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:11:07,611 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-08 14:11:08,993 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-08 14:11:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:11:12,161 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-08 14:11:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:11:12,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:11:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:11:12,163 INFO L225 Difference]: With dead ends: 392 [2019-01-08 14:11:12,163 INFO L226 Difference]: Without dead ends: 386 [2019-01-08 14:11:12,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:11:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-08 14:11:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-08 14:11:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-08 14:11:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-08 14:11:15,458 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-08 14:11:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:11:15,458 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-08 14:11:15,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:11:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-08 14:11:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:11:15,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:11:15,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:11:15,459 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:11:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-08 14:11:15,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:11:15,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:15,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:11:15,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:15,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:11:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:15,548 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-08 14:11:15,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:11:15,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 14:11:15,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:11:15,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:11:15,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:11:15,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:11:15,549 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-08 14:11:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:11:18,656 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-08 14:11:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:11:18,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-08 14:11:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:11:18,658 INFO L225 Difference]: With dead ends: 320 [2019-01-08 14:11:18,658 INFO L226 Difference]: Without dead ends: 315 [2019-01-08 14:11:18,658 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-08 14:11:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-08 14:11:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-08 14:11:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-08 14:11:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-08 14:11:21,942 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-08 14:11:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:11:21,943 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-08 14:11:21,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:11:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-08 14:11:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:11:21,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:11:21,944 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:11:21,944 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:11:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-08 14:11:21,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:11:21,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:21,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:11:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:21,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:11:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:22,019 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-08 14:11:22,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:22,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:11:22,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:11:22,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:11:22,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:22,020 INFO 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-08 14:11:22,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:11:22,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:11:22,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:11:22,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:11:22,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:11:22,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-08 14:11:22,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,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-08 14:11:22,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-08 14:11:22,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,140 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-08 14:11:22,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,205 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-08 14:11:22,209 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-08 14:11:22,213 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-08 14:11:22,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, 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-08 14:11:22,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:11:22,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,242 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,255 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,265 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,275 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,303 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-08 14:11:22,304 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:11:22,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,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, 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-08 14:11:22,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,356 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-08 14:11:22,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-08 14:11:22,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,387 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-08 14:11:22,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,418 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-08 14:11:22,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-08 14:11:22,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,461 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-08 14:11:22,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:11:22,559 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-08 14:11:22,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-08 14:11:22,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:22,666 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:11:22,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:11:22,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:22,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:11:22,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:11:22,714 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-08 14:11:22,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:11:22,779 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-08 14:11:22,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:11:22,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:11:22,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:11:22,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:11:22,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:11:22,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:11:22,800 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-08 14:11:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:11:29,437 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-08 14:11:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:11:29,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:11:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:11:29,439 INFO L225 Difference]: With dead ends: 601 [2019-01-08 14:11:29,439 INFO L226 Difference]: Without dead ends: 591 [2019-01-08 14:11:29,440 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-08 14:11:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-08 14:11:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-08 14:11:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-08 14:11:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-08 14:11:34,869 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-08 14:11:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:11:34,869 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-08 14:11:34,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:11:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-08 14:11:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:11:34,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:11:34,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:11:34,871 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:11:34,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-08 14:11:34,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:11:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:34,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:11:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:34,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:11:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:34,949 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-08 14:11:34,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:34,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:11:34,950 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:11:34,950 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-08 14:11:34,951 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:11:34,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:11:34,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:11:34,953 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-08 14:11:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:34,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:11:34,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:34,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 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-08 14:11:34,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:11:34,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:11:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:34,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:11:34,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 43 treesize of output 39 [2019-01-08 14:11:34,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:34,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:34,990 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-08 14:11:35,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,031 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-08 14:11:35,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,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, 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-08 14:11:35,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,156 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-08 14:11:35,159 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-08 14:11:35,162 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-08 14:11:35,166 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-08 14:11:35,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 27 treesize of output 62 [2019-01-08 14:11:35,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,192 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,214 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,224 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:11:35,252 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:11:35,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,280 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-08 14:11:35,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,306 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-08 14:11:35,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:11:35,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,340 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-08 14:11:35,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:35,369 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-08 14:11:35,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-08 14:11:35,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,401 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:11:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:35,411 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-08 14:11:35,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:11:35,509 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-08 14:11:35,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-08 14:11:35,557 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-08 14:11:35,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:11:35,591 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-08 14:11:35,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:11:35,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:11:35,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:11:35,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:11:35,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:11:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:11:35,612 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-08 14:11:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:11:45,875 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-08 14:11:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:11:45,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-08 14:11:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:11:45,878 INFO L225 Difference]: With dead ends: 731 [2019-01-08 14:11:45,878 INFO L226 Difference]: Without dead ends: 718 [2019-01-08 14:11:45,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:11:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-08 14:11:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-08 14:11:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-08 14:11:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-08 14:11:54,826 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-08 14:11:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:11:54,826 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-08 14:11:54,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:11:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-08 14:11:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:11:54,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:11:54,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:11:54,827 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:11:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-08 14:11:54,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:11:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:54,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:11:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:11:54,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:11:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:54,984 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-08 14:11:54,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:54,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:11:54,985 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:11:54,985 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-08 14:11:54,986 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:11:54,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:11:54,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:11:54,989 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-08 14:11:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:11:54,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:11:54,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:11:54,989 INFO 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-08 14:11:55,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:11:55,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:11:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:11:55,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:11:55,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:11:55,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,070 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-08 14:11:55,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,111 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-08 14:11:55,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:11:55,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,234 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-08 14:11:55,237 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-08 14:11:55,239 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-08 14:11:55,243 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-08 14:11:55,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:11:55,246 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,303 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,316 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,325 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,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-08 14:11:55,363 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:11:55,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,410 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-08 14:11:55,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-08 14:11:55,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:11:55,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,481 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-08 14:11:55,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-08 14:11:55,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,513 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:11:55,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:11:55,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,538 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-08 14:11:55,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-08 14:11:55,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:11:55,569 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:11:55,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:11:55,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:11:55,590 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-08 14:11:55,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-08 14:11:55,613 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-08 14:11:55,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:11:55,688 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-08 14:11:55,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:11:55,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:11:55,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:11:55,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:11:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:11:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:11:55,707 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-08 14:12:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:12:06,190 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-08 14:12:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:12:06,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:12:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:12:06,191 INFO L225 Difference]: With dead ends: 480 [2019-01-08 14:12:06,191 INFO L226 Difference]: Without dead ends: 473 [2019-01-08 14:12:06,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:12:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-08 14:12:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-08 14:12:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-08 14:12:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-08 14:12:09,669 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-08 14:12:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:12:09,670 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-08 14:12:09,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:12:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-08 14:12:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:12:09,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:12:09,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:12:09,671 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:12:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-08 14:12:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:12:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:09,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:09,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:12:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:09,904 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-08 14:12:10,046 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-08 14:12:10,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:10,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:12:10,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:12:10,047 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-08 14:12:10,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:12:10,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:12:10,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:12:10,053 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-08 14:12:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:10,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:12:10,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:10,053 INFO 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-08 14:12:10,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:10,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:12:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:10,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:12:10,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:12:10,113 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-08 14:12:10,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,117 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-08 14:12:10,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,126 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-08 14:12:10,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:12:10,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,162 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:12:10,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,233 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-08 14:12:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:12:10,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,315 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-08 14:12:10,315 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,330 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,360 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,388 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-08 14:12:10,388 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:12:10,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,434 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-08 14:12:10,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,452 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-08 14:12:10,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:12:10,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:12:10,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,503 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-08 14:12:10,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:12:10,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,531 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:12:10,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:10,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:12:10,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:10,557 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-08 14:12:10,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:12:10,577 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-08 14:12:10,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:12:10,608 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-08 14:12:10,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:12:10,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:12:10,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:12:10,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:12:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:12:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:12:10,628 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-08 14:12:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:12:16,179 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-08 14:12:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:12:16,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-08 14:12:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:12:16,181 INFO L225 Difference]: With dead ends: 258 [2019-01-08 14:12:16,181 INFO L226 Difference]: Without dead ends: 243 [2019-01-08 14:12:16,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:12:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-08 14:12:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-08 14:12:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-08 14:12:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-08 14:12:20,889 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-08 14:12:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:12:20,889 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-08 14:12:20,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:12:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-08 14:12:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:12:20,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:12:20,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:12:20,890 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:12:20,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-08 14:12:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:12:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:20,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:12:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:21,049 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-08 14:12:21,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:21,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:12:21,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:12:21,050 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-08 14:12:21,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:12:21,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:12:21,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:12:21,052 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-08 14:12:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:21,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:12:21,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:21,053 INFO 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-08 14:12:21,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:21,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:12:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:21,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:12:21,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:12:21,078 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-08 14:12:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,083 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-08 14:12:21,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,092 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-08 14:12:21,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:12:21,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:12:21,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,195 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-08 14:12:21,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,231 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-08 14:12:21,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,291 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-08 14:12:21,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,306 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,319 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,335 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,363 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-08 14:12:21,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,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, 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-08 14:12:21,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,425 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-08 14:12:21,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-08 14:12:21,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,463 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:12:21,471 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-08 14:12:21,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:12:21,565 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-08 14:12:21,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-08 14:12:21,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,614 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:12:21,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, 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-08 14:12:21,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,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, 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-08 14:12:21,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,729 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-08 14:12:21,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-08 14:12:21,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,794 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:12:21,795 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-08 14:12:21,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:21,879 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:12:21,880 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-08 14:12:21,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:21,924 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-08 14:12:21,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-08 14:12:21,965 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-08 14:12:21,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:12:22,012 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-08 14:12:22,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:12:22,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:12:22,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:12:22,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:12:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:12:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:12:22,032 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-08 14:12:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:12:28,534 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-08 14:12:28,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:12:28,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:12:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:12:28,536 INFO L225 Difference]: With dead ends: 295 [2019-01-08 14:12:28,536 INFO L226 Difference]: Without dead ends: 284 [2019-01-08 14:12:28,536 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-08 14:12:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-08 14:12:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-08 14:12:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-08 14:12:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-08 14:12:33,522 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-08 14:12:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:12:33,522 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-08 14:12:33,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:12:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-08 14:12:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:12:33,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:12:33,523 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:12:33,523 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:12:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-08 14:12:33,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:12:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:33,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:12:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:33,611 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-08 14:12:33,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:33,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:12:33,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:12:33,611 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-08 14:12:33,612 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:12:33,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:12:33,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:12:33,614 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-08 14:12:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:33,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:12:33,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:33,615 INFO 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-08 14:12:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:33,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:12:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:33,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:12:33,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:12:33,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:12:33,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,642 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-08 14:12:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,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, 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-08 14:12:33,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:12:33,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:12:33,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,761 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-08 14:12:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,796 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-08 14:12:33,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,841 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-08 14:12:33,841 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,857 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,887 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,913 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-08 14:12:33,914 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-08 14:12:33,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,934 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-08 14:12:33,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:33,962 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-08 14:12:33,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-08 14:12:33,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:33,993 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-08 14:12:33,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:12:34,094 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-08 14:12:34,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-08 14:12:34,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:34,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, 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-08 14:12:34,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:34,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-08 14:12:34,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-08 14:12:34,202 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-08 14:12:34,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:12:34,248 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-08 14:12:34,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:12:34,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:12:34,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:12:34,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:12:34,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:12:34,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:12:34,268 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-08 14:12:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:12:41,622 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-08 14:12:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:12:41,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-08 14:12:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:12:41,623 INFO L225 Difference]: With dead ends: 328 [2019-01-08 14:12:41,623 INFO L226 Difference]: Without dead ends: 315 [2019-01-08 14:12:41,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:12:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-08 14:12:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-08 14:12:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-08 14:12:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-08 14:12:48,677 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-08 14:12:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:12:48,677 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-08 14:12:48,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:12:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-08 14:12:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:12:48,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:12:48,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:12:48,678 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:12:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:48,678 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-08 14:12:48,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:12:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:48,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:48,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:12:48,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:12:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:48,870 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-08 14:12:48,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:48,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:12:48,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:12:48,871 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-08 14:12:48,872 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:12:48,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:12:48,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:12:48,874 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-08 14:12:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:12:48,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:12:48,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:12:48,874 INFO 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-08 14:12:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:12:48,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:12:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:12:48,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:12:49,073 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-08 14:12:49,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,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 48 treesize of output 54 [2019-01-08 14:12:49,476 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-08 14:12:49,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,533 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-08 14:12:49,699 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-08 14:12:49,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-08 14:12:49,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,761 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-08 14:12:49,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,842 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-08 14:12:49,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, 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-08 14:12:49,847 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-08 14:12:49,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:12:49,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:12:49,853 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,877 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,902 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:12:49,942 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-08 14:12:49,942 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:12:49,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:49,979 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-08 14:12:49,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:50,008 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-08 14:12:50,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:12:50,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:12:50,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:50,076 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-08 14:12:50,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-08 14:12:50,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,110 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:12:50,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:12:50,112 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-08 14:12:50,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:12:50,148 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-08 14:12:50,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-08 14:12:50,176 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-08 14:12:50,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:12:50,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-08 14:12:50,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:12:50,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:12:50,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:12:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:12:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:12:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:12:50,237 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-08 14:12:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:12:59,999 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-08 14:12:59,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:13:00,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-08 14:13:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:13:00,001 INFO L225 Difference]: With dead ends: 326 [2019-01-08 14:13:00,001 INFO L226 Difference]: Without dead ends: 313 [2019-01-08 14:13:00,001 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-08 14:13:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-08 14:13:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-08 14:13:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-08 14:13:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-08 14:13:08,637 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-08 14:13:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:13:08,637 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-08 14:13:08,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:13:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-08 14:13:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:13:08,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:13:08,638 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:13:08,638 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:13:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:13:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-08 14:13:08,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:13:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:13:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:13:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:13:08,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:13:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:13:08,713 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-08 14:13:08,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:13:08,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:13:08,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:13:08,714 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-08 14:13:08,715 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:13:08,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:13:08,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:13:08,717 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-08 14:13:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:13:08,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:13:08,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:13:08,718 INFO 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-08 14:13:08,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:13:08,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:13:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:13:08,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:13:08,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:13:08,741 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-08 14:13:08,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,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, 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-08 14:13:08,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,755 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-08 14:13:08,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-08 14:13:08,762 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,814 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:13:08,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,863 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-08 14:13:08,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:13:08,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:08,944 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-08 14:13:08,944 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,959 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,974 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:08,989 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:09,016 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-08 14:13:09,017 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:13:09,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,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, 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-08 14:13:09,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:13:09,141 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-08 14:13:09,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-08 14:13:09,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,184 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:09,185 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-08 14:13:09,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:09,204 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-08 14:13:09,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-08 14:13:09,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:13:09,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:09,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:13:09,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-08 14:13:09,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:09,280 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-08 14:13:09,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:09,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:13:09,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-08 14:13:09,326 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-08 14:13:09,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:13:09,371 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-08 14:13:09,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:13:09,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:13:09,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:13:09,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:13:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:13:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:13:09,391 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-08 14:13:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:13:21,350 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-08 14:13:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:13:21,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-08 14:13:21,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:13:21,352 INFO L225 Difference]: With dead ends: 400 [2019-01-08 14:13:21,352 INFO L226 Difference]: Without dead ends: 393 [2019-01-08 14:13:21,353 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-08 14:13:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-08 14:13:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-08 14:13:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-08 14:13:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-08 14:13:32,188 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-08 14:13:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:13:32,188 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-08 14:13:32,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:13:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-08 14:13:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:13:32,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:13:32,189 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:13:32,189 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:13:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:13:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-08 14:13:32,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:13:32,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:13:32,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:13:32,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:13:32,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:13:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:13:32,362 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-01-08 14:13:32,418 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-08 14:13:32,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:13:32,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:13:32,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:13:32,419 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-08 14:13:32,419 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:13:32,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:13:32,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:13:32,421 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-08 14:13:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:13:32,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:13:32,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:13:32,422 INFO 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-08 14:13:32,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:13:32,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:13:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:13:32,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:13:32,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:13:32,449 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-08 14:13:32,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:13:32,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,482 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-08 14:13:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:13:32,491 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:13:32,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,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 36 treesize of output 49 [2019-01-08 14:13:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,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, 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-08 14:13:32,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,671 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-08 14:13:32,672 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,687 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,701 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:32,745 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-08 14:13:32,746 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-08 14:13:32,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,782 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-08 14:13:32,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:13:32,877 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-08 14:13:32,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-08 14:13:32,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:32,944 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:32,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, 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-08 14:13:32,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:33,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,009 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:33,009 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-08 14:13:33,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:33,056 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-08 14:13:33,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-08 14:13:33,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,103 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-08 14:13:33,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:33,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,165 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:33,166 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-08 14:13:33,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:33,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-08 14:13:33,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-08 14:13:33,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,262 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-08 14:13:33,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:33,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:33,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:13:33,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:33,372 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-08 14:13:33,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-08 14:13:33,416 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-08 14:13:33,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:13:33,476 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-08 14:13:33,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:13:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:13:33,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:13:33,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:13:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:13:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:13:33,495 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-08 14:13:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:13:46,580 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-08 14:13:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:13:46,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-08 14:13:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:13:46,583 INFO L225 Difference]: With dead ends: 441 [2019-01-08 14:13:46,583 INFO L226 Difference]: Without dead ends: 428 [2019-01-08 14:13:46,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:13:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-08 14:13:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-08 14:13:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-08 14:13:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-08 14:13:57,508 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-08 14:13:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:13:57,509 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-08 14:13:57,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:13:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-08 14:13:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:13:57,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:13:57,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:13:57,510 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:13:57,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:13:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-08 14:13:57,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:13:57,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:13:57,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:13:57,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:13:57,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:13:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:13:57,782 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-08 14:13:57,871 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-08 14:13:57,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:13:57,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:13:57,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:13:57,872 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-08 14:13:57,873 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:13:57,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:13:57,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:13:57,875 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-08 14:13:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:13:57,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:13:57,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:13:57,876 INFO 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-08 14:13:57,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:13:57,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:13:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:13:57,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:13:57,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:13:57,902 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-08 14:13:57,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,909 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-08 14:13:57,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,917 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-08 14:13:57,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:57,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:13:57,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:57,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:57,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:57,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:57,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,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 43 treesize of output 39 [2019-01-08 14:13:58,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,021 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-08 14:13:58,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,055 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-08 14:13:58,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,100 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-08 14:13:58,101 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,116 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,130 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,146 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,174 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-08 14:13:58,174 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:13:58,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,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 72 [2019-01-08 14:13:58,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:13:58,306 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-08 14:13:58,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-08 14:13:58,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-01-08 14:13:58,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,460 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-08 14:13:58,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,511 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-08 14:13:58,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-08 14:13:58,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,563 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:58,564 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-08 14:13:58,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,629 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:58,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:13:58,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,674 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-08 14:13:58,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-08 14:13:58,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:58,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:13:58,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:13:58,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:13:58,788 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-08 14:13:58,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:13:58,840 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-08 14:13:58,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-08 14:13:58,894 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-08 14:13:58,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:13:58,958 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-08 14:13:58,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:13:58,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:13:58,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:13:58,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:13:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:13:58,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:13:58,977 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-08 14:14:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:14:20,204 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-08 14:14:20,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:14:20,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:14:20,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:14:20,206 INFO L225 Difference]: With dead ends: 685 [2019-01-08 14:14:20,206 INFO L226 Difference]: Without dead ends: 677 [2019-01-08 14:14:20,206 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-08 14:14:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-08 14:14:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-08 14:14:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-08 14:14:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-08 14:14:36,547 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-08 14:14:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:14:36,548 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-08 14:14:36,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:14:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-08 14:14:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:14:36,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:14:36,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:14:36,549 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:14:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:14:36,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-08 14:14:36,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:14:36,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:14:36,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:14:36,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:14:36,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:14:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:14:36,787 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-08 14:14:36,880 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-08 14:14:36,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:14:36,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:14:36,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:14:36,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:14:36,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:14:36,880 INFO 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-08 14:14:36,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:14:36,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:14:36,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:14:36,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:14:36,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:14:36,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:14:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,914 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-08 14:14:36,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:14:36,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:36,994 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-08 14:14:36,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,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, 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-08 14:14:37,065 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-08 14:14:37,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:14:37,072 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-08 14:14:37,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:14:37,075 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,098 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,120 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,158 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-08 14:14:37,158 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:14:37,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,199 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-08 14:14:37,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:14:37,292 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-08 14:14:37,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-08 14:14:37,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,398 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-08 14:14:37,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,853 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:14:37,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 45 treesize of output 51 [2019-01-08 14:14:37,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:37,897 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-08 14:14:37,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-08 14:14:37,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:37,983 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:14:37,984 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-08 14:14:37,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:38,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-08 14:14:38,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:38,089 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-08 14:14:38,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-08 14:14:38,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,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, 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-08 14:14:38,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:38,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:14:38,214 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:14:38,215 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-08 14:14:38,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:14:38,266 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-08 14:14:38,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-08 14:14:38,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-08 14:14:38,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:14:38,385 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-08 14:14:38,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:14:38,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-08 14:14:38,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:14:38,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:14:38,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:14:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:14:38,405 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-08 14:14:43,072 WARN L181 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-08 14:14:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:14:58,370 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-08 14:14:58,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:14:58,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-08 14:14:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:14:58,372 INFO L225 Difference]: With dead ends: 550 [2019-01-08 14:14:58,372 INFO L226 Difference]: Without dead ends: 543 [2019-01-08 14:14:58,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:14:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-08 14:15:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-08 14:15:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:15:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-08 14:15:01,581 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-08 14:15:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:15:01,581 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-08 14:15:01,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:15:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-08 14:15:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:15:01,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:15:01,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:15:01,582 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:15:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:15:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-08 14:15:01,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:15:01,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:01,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:15:01,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:01,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:15:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:15:01,670 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-08 14:15:01,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:01,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:15:01,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-08 14:15:01,671 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-08 14:15:01,671 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:15:01,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:15:01,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:15:01,674 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-08 14:15:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:15:01,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:15:01,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:01,674 INFO 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-08 14:15:01,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:15:01,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:15:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:15:01,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:15:01,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,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, 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-08 14:15:01,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,744 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-08 14:15:01,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,782 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-08 14:15:01,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:01,829 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-08 14:15:01,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:01,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:01,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:01,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:01,896 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-08 14:15:01,899 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-08 14:15:01,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, 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-08 14:15:01,924 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-08 14:15:01,942 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-08 14:15:01,943 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:02,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:02,518 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:02,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:02,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:03,153 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-08 14:15:03,153 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-08 14:15:03,530 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-08 14:15:03,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:15:03,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:03,660 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-08 14:15:03,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-08 14:15:03,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,699 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-08 14:15:03,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:03,732 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-08 14:15:03,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-08 14:15:03,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,766 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:03,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,768 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-08 14:15:03,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:03,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:15:03,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-08 14:15:03,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:03,841 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:03,841 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-08 14:15:03,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:03,877 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-08 14:15:03,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:15:04,413 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-08 14:15:04,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:15:04,489 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-08 14:15:04,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:15:04,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-08 14:15:04,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:15:04,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:15:04,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:15:04,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:15:04,510 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-08 14:15:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:15:10,747 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-08 14:15:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:15:10,747 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-08 14:15:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:15:10,748 INFO L225 Difference]: With dead ends: 67 [2019-01-08 14:15:10,748 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 14:15:10,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:15:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 14:15:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-08 14:15:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:15:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-08 14:15:14,177 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-08 14:15:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:15:14,177 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-08 14:15:14,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:15:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-08 14:15:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:15:14,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:15:14,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:15:14,178 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:15:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:15:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-08 14:15:14,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:15:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:14,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:15:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:14,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:15:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:15:14,419 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-08 14:15:14,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:14,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:15:14,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-08 14:15:14,419 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-08 14:15:14,420 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:15:14,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:15:14,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:15:14,422 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-08 14:15:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:15:14,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:15:14,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:14,422 INFO 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-08 14:15:14,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:15:14,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:15:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:15:14,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:15:14,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-08 14:15:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,457 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-08 14:15:14,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,492 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-08 14:15:14,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,536 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-08 14:15:14,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,604 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-08 14:15:14,607 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-08 14:15:14,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:15:14,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:15:14,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-08 14:15:14,616 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,637 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,649 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,659 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,669 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,697 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-08 14:15:14,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-08 14:15:14,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:14,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:15:14,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-08 14:15:14,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,809 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-08 14:15:14,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:15:14,908 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-08 14:15:14,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-08 14:15:14,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:14,973 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:14,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:15:14,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:15,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:15,036 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-08 14:15:15,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:15,090 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-08 14:15:15,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-08 14:15:15,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,150 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:15,151 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-08 14:15:15,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:15,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:15,222 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:15,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:15:15,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:15,264 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-08 14:15:15,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-08 14:15:15,328 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-08 14:15:15,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:15:15,389 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-08 14:15:15,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:15:15,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:15:15,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:15:15,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:15:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:15:15,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:15:15,408 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-08 14:15:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:15:22,044 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-08 14:15:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:15:22,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-08 14:15:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:15:22,045 INFO L225 Difference]: With dead ends: 74 [2019-01-08 14:15:22,045 INFO L226 Difference]: Without dead ends: 59 [2019-01-08 14:15:22,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:15:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-08 14:15:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-08 14:15:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:15:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-08 14:15:25,826 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-08 14:15:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:15:25,826 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-08 14:15:25,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:15:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-08 14:15:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:15:25,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:15:25,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:15:25,827 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:15:25,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:15:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-08 14:15:25,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:15:25,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:25,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:15:25,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:25,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:15:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:15:25,970 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-08 14:15:25,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:25,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:15:25,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-08 14:15:25,971 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-08 14:15:25,971 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:15:25,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:15:25,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:15:25,974 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-08 14:15:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:15:25,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:15:25,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:25,974 INFO 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-08 14:15:25,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:15:25,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:15:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:15:25,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:15:25,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, 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-08 14:15:26,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-08 14:15:26,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-08 14:15:26,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,099 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-08 14:15:26,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-08 14:15:26,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, 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-08 14:15:26,174 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-08 14:15:26,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:15:26,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-08 14:15:26,180 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,206 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,237 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,270 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-08 14:15:26,271 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-08 14:15:26,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,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, 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-08 14:15:26,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,335 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-08 14:15:26,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:15:26,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:15:26,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,387 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-08 14:15:26,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:15:26,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,417 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:26,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-08 14:15:26,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,441 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-08 14:15:26,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:15:26,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:26,471 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:26,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, 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-08 14:15:26,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:26,495 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-08 14:15:26,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-08 14:15:26,520 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-08 14:15:26,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:15:26,636 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-08 14:15:26,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:15:26,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-08 14:15:26,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:15:26,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:15:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:15:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:15:26,656 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-08 14:15:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:15:34,344 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-08 14:15:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:15:34,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-08 14:15:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:15:34,345 INFO L225 Difference]: With dead ends: 80 [2019-01-08 14:15:34,345 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 14:15:34,346 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-08 14:15:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 14:15:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-08 14:15:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-08 14:15:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-08 14:15:41,143 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-08 14:15:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:15:41,143 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-08 14:15:41,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:15:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-08 14:15:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-08 14:15:41,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:15:41,143 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:15:41,143 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:15:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:15:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-08 14:15:41,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:15:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:41,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:15:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:15:41,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:15:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:15:41,265 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-08 14:15:41,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:41,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:15:41,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:15:41,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:15:41,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:15:41,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:15:41,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:15:41,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:15:41,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:15:41,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:15:41,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:15:41,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:15:41,288 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-08 14:15:41,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, 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-08 14:15:41,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, 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-08 14:15:41,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,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, 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-08 14:15:41,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:15:41,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-08 14:15:41,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, 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-08 14:15:41,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,400 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-08 14:15:41,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,408 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,423 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:15:41,441 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-08 14:15:41,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,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, 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-08 14:15:41,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:15:41,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-08 14:15:41,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-08 14:15:41,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,541 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-08 14:15:41,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-08 14:15:41,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-08 14:15:41,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-08 14:15:41,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,640 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-08 14:15:41,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,681 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-08 14:15:41,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,697 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-08 14:15:41,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-08 14:15:41,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,724 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-08 14:15:41,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:15:41,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,783 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-08 14:15:41,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-08 14:15:41,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,820 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:15:41,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,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, 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-08 14:15:41,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:15:41,855 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-08 14:15:41,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:15:41,875 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-08 14:15:41,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-08 14:15:41,906 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-08 14:15:41,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:15:41,976 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-08 14:15:41,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:15:41,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-08 14:15:41,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:15:41,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:15:41,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:15:41,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:15:41,995 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-08 14:15:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:15:49,279 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-08 14:15:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:15:49,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-08 14:15:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:15:49,280 INFO L225 Difference]: With dead ends: 71 [2019-01-08 14:15:49,280 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:15:49,281 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-08 14:15:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:15:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:15:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:15:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:15:49,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-08 14:15:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:15:49,282 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:15:49,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:15:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:15:49,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:15:49,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:15:49,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:49,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:49,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:49,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:49,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:50,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:50,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:50,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:51,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:15:51,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:16:10,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:16:14,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:16:22,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:16:23,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:16:33,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:16:34,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:16:58,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent.