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-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:22:31,340 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:22:31,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:22:31,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:22:31,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:22:31,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:22:31,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:22:31,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:22:31,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:22:31,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:22:31,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:22:31,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:22:31,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:22:31,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:22:31,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:22:31,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:22:31,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:22:31,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:22:31,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:22:31,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:22:31,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:22:31,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:22:31,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:22:31,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:22:31,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:22:31,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:22:31,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:22:31,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:22:31,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:22:31,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:22:31,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:22:31,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:22:31,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:22:31,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:22:31,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:22:31,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:22:31,392 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 14:22:31,404 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:22:31,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:22:31,405 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:22:31,405 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:22:31,405 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:22:31,406 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:22:31,406 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:22:31,406 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:22:31,406 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:22:31,406 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:22:31,406 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:22:31,407 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:22:31,407 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:22:31,407 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:22:31,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:22:31,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:22:31,408 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:22:31,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:22:31,408 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:22:31,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:22:31,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:22:31,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:22:31,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:22:31,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:22:31,410 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:22:31,410 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:22:31,410 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:22:31,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:22:31,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:22:31,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:22:31,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:22:31,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:22:31,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:22:31,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:22:31,412 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:22:31,412 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:22:31,412 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:22:31,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:22:31,412 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:22:31,413 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:22:31,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:22:31,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:22:31,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:22:31,463 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:22:31,463 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:22:31,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-11 14:22:31,464 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-11 14:22:31,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:22:31,518 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:22:31,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:22:31,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:22:31,520 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:22:31,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:22:31,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:22:31,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:22:31,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:22:31,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... [2019-01-11 14:22:31,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:22:31,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:22:31,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:22:31,602 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:22:31,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:22:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:22:31,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:22:32,126 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:22:32,126 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-11 14:22:32,127 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:22:32 BoogieIcfgContainer [2019-01-11 14:22:32,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:22:32,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:22:32,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:22:32,139 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:22:32,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:31" (1/2) ... [2019-01-11 14:22:32,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@936329 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:22:32, skipping insertion in model container [2019-01-11 14:22:32,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:22:32" (2/2) ... [2019-01-11 14:22:32,142 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-11 14:22:32,152 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:22:32,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-11 14:22:32,176 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-11 14:22:32,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:22:32,208 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:22:32,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:22:32,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:22:32,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:22:32,209 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:22:32,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:22:32,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:22:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 14:22:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:22:32,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:32,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:22:32,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-11 14:22:32,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:32,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:32,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:32,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:22:32,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:32,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:22:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:22:32,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:32,433 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-11 14:22:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:32,634 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-11 14:22:32,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:32,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:22:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:32,650 INFO L225 Difference]: With dead ends: 25 [2019-01-11 14:22:32,651 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 14:22:32,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 14:22:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-11 14:22:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:22:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-11 14:22:32,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-11 14:22:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:32,694 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-11 14:22:32,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:22:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-11 14:22:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:32,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:32,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:32,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-11 14:22:32,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:32,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:32,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:32,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:32,984 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 14:22:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:33,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:33,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:33,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:33,011 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-11 14:22:33,063 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:33,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:33,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:33,129 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:33,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:33,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:33,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:33,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:33,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:33,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:33,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:33,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 18 treesize of output 21 [2019-01-11 14:22:33,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:22:33,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:22:33,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,288 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-11 14:22:33,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:22:33,318 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,535 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:33,945 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:34,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:22:34,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:34,141 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-11 14:22:34,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:34,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:34,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:34,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:34,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:34,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:34,323 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-11 14:22:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:34,793 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-11 14:22:34,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:34,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:22:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:34,796 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:22:34,796 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 14:22:34,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-11 14:22:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 14:22:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-11 14:22:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 14:22:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-11 14:22:34,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-11 14:22:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:34,804 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-11 14:22:34,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-11 14:22:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:34,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:34,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:34,806 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-11 14:22:34,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:34,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:34,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:34,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:34,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:34,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:34,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:34,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:34,892 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-11 14:22:34,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:34,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:34,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:34,902 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:34,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:34,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:34,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:34,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:34,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:34,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:34,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:34,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:34,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:34,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,985 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-11 14:22:34,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,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, 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-11 14:22:35,008 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:35,395 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:35,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,462 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-11 14:22:35,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,547 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-11 14:22:35,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:35,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:35,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:22:35,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:22:35,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:35,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:35,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:35,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:35,635 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-11 14:22:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:35,720 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-11 14:22:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:35,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:22:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:35,723 INFO L225 Difference]: With dead ends: 18 [2019-01-11 14:22:35,723 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:22:35,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:22:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 14:22:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:22:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-11 14:22:35,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-11 14:22:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:35,728 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-11 14:22:35,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-11 14:22:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:35,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:35,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:35,730 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-11 14:22:35,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:35,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:35,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:35,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:35,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:35,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:35,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:22:35,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:35,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:22:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:22:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:35,869 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-11 14:22:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:35,909 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-11 14:22:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:35,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:22:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:35,910 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:22:35,911 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 14:22:35,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 14:22:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-11 14:22:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:22:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-11 14:22:35,916 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-11 14:22:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:35,916 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-11 14:22:35,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:22:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-11 14:22:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:35,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:35,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:35,917 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-11 14:22:35,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:35,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:35,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:35,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:35,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:36,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:36,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:36,030 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:36,030 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-11 14:22:36,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:36,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:36,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:36,046 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:36,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:36,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:36,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:36,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:36,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:36,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:36,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:36,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,072 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-11 14:22:36,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,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, 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-11 14:22:36,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,095 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-11 14:22:36,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,120 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-11 14:22:36,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,198 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:36,229 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:36,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,318 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-11 14:22:36,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,368 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-11 14:22:36,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:36,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:36,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:36,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:36,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:36,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:36,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:36,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:36,447 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-11 14:22:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:36,687 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-11 14:22:36,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:36,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:22:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:36,691 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:22:36,691 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 14:22:36,692 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-11 14:22:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 14:22:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-11 14:22:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 14:22:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-11 14:22:36,698 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-11 14:22:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:36,699 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-11 14:22:36,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-11 14:22:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:36,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:36,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:36,700 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-11 14:22:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:36,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:36,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:36,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-11 14:22:36,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:36,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:36,820 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:36,821 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-11 14:22:36,826 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:36,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:36,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:36,833 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:36,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:36,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:36,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:36,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:36,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:36,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:36,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:36,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,873 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-11 14:22:36,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,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, 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-11 14:22:36,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:22:36,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,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, 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-11 14:22:37,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:37,105 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:37,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,159 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-11 14:22:37,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:37,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:37,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,261 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-11 14:22:37,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,398 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-11 14:22:37,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:22:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:37,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:37,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:37,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:37,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:37,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:37,487 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-11 14:22:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:38,080 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-01-11 14:22:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:38,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:38,082 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:22:38,083 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:22:38,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:22:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-01-11 14:22:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 14:22:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-11 14:22:38,090 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-11 14:22:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:38,090 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-11 14:22:38,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-11 14:22:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:38,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:38,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:38,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-01-11 14:22:38,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:38,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:38,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:38,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:38,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:38,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:38,227 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-11 14:22:38,228 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:38,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:38,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:38,239 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:38,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:38,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:38,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:38,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:38,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:38,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:38,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:38,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:22:38,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,299 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-11 14:22:38,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,313 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-11 14:22:38,314 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,355 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:38,408 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:38,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,454 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-11 14:22:38,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,511 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-11 14:22:38,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:38,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,570 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-11 14:22:38,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,662 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-11 14:22:38,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:22:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:38,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:38,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:38,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:38,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:38,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:38,762 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-11 14:22:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:39,541 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-01-11 14:22:39,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:39,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:39,544 INFO L225 Difference]: With dead ends: 47 [2019-01-11 14:22:39,544 INFO L226 Difference]: Without dead ends: 46 [2019-01-11 14:22:39,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-11 14:22:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-01-11 14:22:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 14:22:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-01-11 14:22:39,554 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-01-11 14:22:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:39,554 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-01-11 14:22:39,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-01-11 14:22:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:39,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:39,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:39,555 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:39,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:39,555 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-11 14:22:39,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:39,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:39,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:39,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:39,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:39,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:39,646 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-11 14:22:39,650 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:39,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:39,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:39,659 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:39,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:39,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:39,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:39,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:39,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:39,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:39,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:39,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:39,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:22:39,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:22:39,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:22:39,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:39,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,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-11 14:22:39,818 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:22:39,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:39,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:22:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:39,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:39,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:22:39,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:22:39,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:39,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:39,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:39,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:39,985 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-01-11 14:22:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:40,042 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-01-11 14:22:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:40,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:22:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:40,043 INFO L225 Difference]: With dead ends: 28 [2019-01-11 14:22:40,043 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 14:22:40,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 14:22:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-11 14:22:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:22:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-01-11 14:22:40,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-01-11 14:22:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:40,050 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-01-11 14:22:40,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-01-11 14:22:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:40,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:40,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:40,052 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-11 14:22:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:40,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:40,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:40,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:40,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:40,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:40,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:40,256 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-11 14:22:40,257 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:40,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:40,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:40,263 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:40,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:40,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:40,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:40,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:40,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:40,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:40,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:40,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:22:40,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:40,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,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, 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-11 14:22:40,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,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, 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-11 14:22:40,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:40,443 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:40,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,490 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-11 14:22:40,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:40,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:40,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,650 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:40,651 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-11 14:22:40,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,697 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-11 14:22:40,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:22:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:40,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:40,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:40,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:40,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:40,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:40,794 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-01-11 14:22:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:41,219 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-01-11 14:22:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:41,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:41,221 INFO L225 Difference]: With dead ends: 44 [2019-01-11 14:22:41,221 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 14:22:41,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 14:22:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-01-11 14:22:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 14:22:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-01-11 14:22:41,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-01-11 14:22:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:41,230 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-01-11 14:22:41,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-01-11 14:22:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:41,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:41,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:41,231 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-11 14:22:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:41,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:41,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:41,299 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-11 14:22:41,301 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:41,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:41,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:41,306 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:41,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:41,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:41,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:41,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:41,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:41,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:41,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:41,333 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-11 14:22:41,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:22:41,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:22:41,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,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, 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-11 14:22:41,386 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:41,466 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:22:41,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:41,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:41,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:22:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:41,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:41,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:41,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:41,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:41,590 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-01-11 14:22:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:41,835 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-01-11 14:22:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:41,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:22:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:41,837 INFO L225 Difference]: With dead ends: 43 [2019-01-11 14:22:41,837 INFO L226 Difference]: Without dead ends: 42 [2019-01-11 14:22:41,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-11 14:22:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-01-11 14:22:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:22:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-01-11 14:22:41,845 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-01-11 14:22:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:41,845 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-01-11 14:22:41,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-01-11 14:22:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:41,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:41,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:41,846 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-11 14:22:41,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:41,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:41,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:42,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:42,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:42,089 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-11 14:22:42,090 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:42,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:42,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:42,095 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:42,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:42,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:42,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:42,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:42,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:42,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:42,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:42,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:42,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:42,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,169 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-11 14:22:42,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:22:42,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,329 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,405 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-11 14:22:42,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:42,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,499 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-11 14:22:42,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,547 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-11 14:22:42,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:42,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:42,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:42,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:42,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:42,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:42,618 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-01-11 14:22:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:43,032 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-01-11 14:22:43,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:43,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:43,034 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:22:43,034 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:22:43,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:22:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-01-11 14:22:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 14:22:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-11 14:22:43,043 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-11 14:22:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:43,044 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-11 14:22:43,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-11 14:22:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:43,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:43,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:43,045 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-01-11 14:22:43,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:43,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:43,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:43,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:43,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:43,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:43,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:43,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:22:43,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:43,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:43,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:43,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,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, 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-11 14:22:43,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:43,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:43,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:22:43,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:43,268 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:43,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,312 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-11 14:22:43,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,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-11 14:22:43,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:43,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,475 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-11 14:22:43,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,525 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-11 14:22:43,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:43,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:43,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:43,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:43,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:43,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:43,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:43,668 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-01-11 14:22:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:44,030 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-01-11 14:22:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:44,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:44,032 INFO L225 Difference]: With dead ends: 66 [2019-01-11 14:22:44,032 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 14:22:44,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 14:22:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-11 14:22:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:22:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-01-11 14:22:44,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-01-11 14:22:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:44,041 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-01-11 14:22:44,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-01-11 14:22:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:44,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:44,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:44,042 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-11 14:22:44,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:44,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:44,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:44,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:44,109 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-01-11 14:22:44,110 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:44,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:44,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:44,115 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:44,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:44,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:44,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:44,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,151 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-11 14:22:44,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:44,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:22:44,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,264 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:44,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,298 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-11 14:22:44,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,339 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-11 14:22:44,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:44,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:44,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:44,391 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-01-11 14:22:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:44,578 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-01-11 14:22:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:44,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:22:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:44,580 INFO L225 Difference]: With dead ends: 45 [2019-01-11 14:22:44,580 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:22:44,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:22:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-11 14:22:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 14:22:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-01-11 14:22:44,588 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-01-11 14:22:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:44,588 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-01-11 14:22:44,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-01-11 14:22:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:44,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:44,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:44,589 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-01-11 14:22:44,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:44,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:22:44,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:44,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:22:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:22:44,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:44,622 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-01-11 14:22:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:44,650 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-01-11 14:22:44,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:44,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 14:22:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:44,652 INFO L225 Difference]: With dead ends: 34 [2019-01-11 14:22:44,652 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 14:22:44,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 14:22:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 14:22:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:22:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-01-11 14:22:44,661 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-01-11 14:22:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:44,661 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-01-11 14:22:44,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:22:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-01-11 14:22:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:44,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:44,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:44,663 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-11 14:22:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:44,759 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:44,759 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-11 14:22:44,760 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:44,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:44,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:44,765 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:44,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:44,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:44,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 18 treesize of output 21 [2019-01-11 14:22:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,804 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-11 14:22:44,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:44,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,835 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-11 14:22:44,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:22:44,854 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,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-11 14:22:44,936 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:44,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:22:44,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,014 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-11 14:22:45,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:45,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,050 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-11 14:22:45,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,108 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-11 14:22:45,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:22:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:45,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:45,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:45,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:45,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:45,153 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-01-11 14:22:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:45,514 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-01-11 14:22:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:45,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:45,516 INFO L225 Difference]: With dead ends: 59 [2019-01-11 14:22:45,516 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 14:22:45,517 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-11 14:22:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 14:22:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-01-11 14:22:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 14:22:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-01-11 14:22:45,527 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-01-11 14:22:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:45,527 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-01-11 14:22:45,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-01-11 14:22:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:45,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:45,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:45,529 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-11 14:22:45,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:45,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:45,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:45,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:45,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:45,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:45,609 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-11 14:22:45,610 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:45,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:45,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:45,621 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:45,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:45,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:45,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:45,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:45,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:45,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:45,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:45,660 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-11 14:22:45,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:22:45,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,686 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:22:45,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,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, 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-11 14:22:45,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,770 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:22:45,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:45,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:22:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:45,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:45,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:45,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:45,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:45,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:45,874 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-01-11 14:22:46,319 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-11 14:22:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:46,747 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-01-11 14:22:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:46,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:22:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:46,748 INFO L225 Difference]: With dead ends: 51 [2019-01-11 14:22:46,748 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 14:22:46,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 14:22:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-11 14:22:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 14:22:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-01-11 14:22:46,758 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-01-11 14:22:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:46,758 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-01-11 14:22:46,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-01-11 14:22:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:46,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:46,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:46,759 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-11 14:22:46,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:46,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:46,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:46,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:46,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:46,878 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-11 14:22:46,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:46,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:46,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:46,884 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:46,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:46,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:46,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:46,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:46,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:46,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:46,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:46,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:46,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,912 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-11 14:22:46,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:46,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:46,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:22:46,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:47,045 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:47,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:22:47,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:47,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:47,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,184 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-11 14:22:47,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,255 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-11 14:22:47,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:47,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:47,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:47,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:47,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:47,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:47,331 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-01-11 14:22:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:47,850 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-01-11 14:22:47,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:47,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:47,852 INFO L225 Difference]: With dead ends: 64 [2019-01-11 14:22:47,852 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 14:22:47,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 14:22:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-01-11 14:22:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 14:22:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-11 14:22:47,863 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-01-11 14:22:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:47,864 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-11 14:22:47,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-11 14:22:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:47,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:47,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:47,865 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-11 14:22:47,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:47,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:47,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:47,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:47,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:47,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:47,966 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-11 14:22:47,967 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:47,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:47,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:47,971 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:47,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:47,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:47,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:47,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:47,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:47,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:47,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:48,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:22:48,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:22:48,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:22:48,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:22:48,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,109 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:22:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:48,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:22:48,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:48,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:22:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:48,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:48,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:48,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:48,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:48,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:48,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:48,330 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-11 14:22:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:48,636 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-01-11 14:22:48,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:48,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:48,638 INFO L225 Difference]: With dead ends: 57 [2019-01-11 14:22:48,638 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 14:22:48,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 14:22:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-11 14:22:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 14:22:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-01-11 14:22:48,647 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-01-11 14:22:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:48,648 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-01-11 14:22:48,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-01-11 14:22:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:48,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:48,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:48,649 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-11 14:22:48,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:48,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:48,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:48,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:48,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:48,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:48,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:48,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:48,799 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-11 14:22:48,803 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:48,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:48,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:48,807 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:48,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:48,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:48,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:48,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:48,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:48,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:48,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:48,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,836 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-11 14:22:48,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:22:48,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,864 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-11 14:22:48,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,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, 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-11 14:22:48,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,957 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:48,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:22:48,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:49,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:49,258 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 14:22:49,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,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, 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-11 14:22:49,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:49,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:22:49,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,431 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:49,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,433 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-11 14:22:49,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,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-11 14:22:49,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:22:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:49,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:49,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:49,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:22:49,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:49,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:49,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:49,980 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-01-11 14:22:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:51,027 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-01-11 14:22:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:51,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:22:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:51,029 INFO L225 Difference]: With dead ends: 68 [2019-01-11 14:22:51,029 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 14:22:51,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:22:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 14:22:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-11 14:22:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 14:22:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-11 14:22:51,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-11 14:22:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:51,040 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-11 14:22:51,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-11 14:22:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:51,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:51,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:51,041 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-11 14:22:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:51,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:51,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:51,393 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 14:22:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:51,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:51,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:51,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:51,432 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-11 14:22:51,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:51,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:51,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:51,436 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:51,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:51,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:51,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:51,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:51,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:51,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:51,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:51,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,465 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-11 14:22:51,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:51,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:51,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:22:51,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:51,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:51,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,683 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-11 14:22:51,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:51,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:51,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,784 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-11 14:22:51,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:51,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:22:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:51,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:51,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:51,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:51,904 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-11 14:22:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:52,277 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-01-11 14:22:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:52,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:52,278 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:22:52,278 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:22:52,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:22:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-01-11 14:22:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 14:22:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-11 14:22:52,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-11 14:22:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:52,290 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-11 14:22:52,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-11 14:22:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:52,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:52,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:52,291 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:52,291 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-01-11 14:22:52,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:52,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:52,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:52,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:52,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:52,358 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-11 14:22:52,359 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:52,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:52,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:52,363 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:52,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:52,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:52,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:52,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:52,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:52,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:52,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:22:52,390 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-11 14:22:52,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, 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-11 14:22:52,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:22:52,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:22:52,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,510 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 14:22:52,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:22:52,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:22:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:52,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:52,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:52,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:52,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:52,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:52,637 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-01-11 14:22:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:52,777 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-01-11 14:22:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:52,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-11 14:22:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:52,778 INFO L225 Difference]: With dead ends: 45 [2019-01-11 14:22:52,779 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:22:52,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:22:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-11 14:22:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:22:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-01-11 14:22:52,786 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-01-11 14:22:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:52,787 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-01-11 14:22:52,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-01-11 14:22:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:52,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:52,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:52,788 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-01-11 14:22:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:52,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:52,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:52,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:52,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:52,881 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-01-11 14:22:52,882 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:52,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:52,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:52,886 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:52,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:52,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:52,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:52,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:52,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:52,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:52,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:52,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,914 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-11 14:22:52,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,935 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-11 14:22:52,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,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, 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-11 14:22:52,944 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,049 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:53,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,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, 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-11 14:22:53,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:53,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,247 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:53,248 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-11 14:22:53,249 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-11 14:22:53,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,293 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-11 14:22:53,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:22:53,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 90 [2019-01-11 14:22:53,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,380 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-11 14:22:53,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:22:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:53,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:53,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:53,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:22:53,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:53,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:53,454 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-01-11 14:22:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:54,025 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-01-11 14:22:54,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:54,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:22:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:54,029 INFO L225 Difference]: With dead ends: 71 [2019-01-11 14:22:54,029 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 14:22:54,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:22:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 14:22:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-11 14:22:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 14:22:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-01-11 14:22:54,054 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-01-11 14:22:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:54,054 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-01-11 14:22:54,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-01-11 14:22:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:54,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:54,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:54,055 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-11 14:22:54,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:54,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:54,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:54,153 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-11 14:22:54,154 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:54,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:54,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:54,158 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:54,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:54,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:54,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:54,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:54,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:54,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:22:54,186 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-11 14:22:54,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:22:54,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:22:54,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,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, 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-11 14:22:54,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:54,288 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:22:54,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:54,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:54,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:22:54,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:22:54,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:54,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:22:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:54,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:54,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:54,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:54,547 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-01-11 14:22:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:54,797 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-01-11 14:22:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:54,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:54,799 INFO L225 Difference]: With dead ends: 59 [2019-01-11 14:22:54,799 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 14:22:54,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 14:22:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-01-11 14:22:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:22:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-11 14:22:54,810 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-11 14:22:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:54,810 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-11 14:22:54,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-11 14:22:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:54,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:54,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:54,811 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-11 14:22:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:54,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,963 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-01-11 14:22:55,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-11 14:22:55,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:55,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:55,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:55,135 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-11 14:22:55,138 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:55,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:55,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:55,142 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:55,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:55,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:55,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:55,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:55,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:55,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:55,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:55,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,231 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-11 14:22:55,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:55,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,364 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-11 14:22:55,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,466 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-11 14:22:55,466 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:55,565 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:55,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,601 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-11 14:22:55,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:55,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:55,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:22:55,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:55,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:22:55,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,786 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:55,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,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 38 treesize of output 97 [2019-01-11 14:22:55,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,845 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-11 14:22:55,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:22:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:55,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:55,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:55,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:22:55,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:55,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:55,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:55,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:55,937 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-11 14:22:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:56,737 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-01-11 14:22:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:56,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:22:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:56,738 INFO L225 Difference]: With dead ends: 71 [2019-01-11 14:22:56,739 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 14:22:56,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:22:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 14:22:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-11 14:22:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 14:22:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-01-11 14:22:56,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-01-11 14:22:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:56,750 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-01-11 14:22:56,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-01-11 14:22:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:56,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:56,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:56,751 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-11 14:22:56,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:56,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:56,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:56,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:56,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:56,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:56,846 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-11 14:22:56,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:56,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:56,852 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:56,853 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:56,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:56,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:56,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:56,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:56,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:56,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:22:56,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,891 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-11 14:22:56,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:56,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,966 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-11 14:22:56,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,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, 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-11 14:22:56,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:57,056 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,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, 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-11 14:22:57,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,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-11 14:22:57,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:57,336 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-11 14:22:57,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,667 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:57,667 INFO L303 Elim1Store]: Index analysis took 328 ms [2019-01-11 14:22:57,669 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-11 14:22:57,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,186 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-11 14:22:58,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:58,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-11 14:22:58,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:58,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:58,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:58,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:58,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:58,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:58,445 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-01-11 14:22:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:58,780 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-01-11 14:22:58,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:58,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:58,781 INFO L225 Difference]: With dead ends: 66 [2019-01-11 14:22:58,781 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 14:22:58,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 14:22:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-01-11 14:22:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:22:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-11 14:22:58,794 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-11 14:22:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:58,794 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-11 14:22:58,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-11 14:22:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:58,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:58,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:58,795 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-01-11 14:22:58,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:58,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:58,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:58,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:58,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:58,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:58,961 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-01-11 14:22:58,962 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:58,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:58,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:58,965 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:58,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:58,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:58,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:58,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:58,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:58,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:58,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:58,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,989 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-11 14:22:58,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:22:59,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,013 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-11 14:22:59,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,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, 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-11 14:22:59,020 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,046 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:59,101 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:22:59,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,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, 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-11 14:22:59,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:59,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:59,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,206 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:59,207 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-11 14:22:59,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:59,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:59,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,298 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-11 14:22:59,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,345 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-11 14:22:59,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:22:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:59,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:59,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:59,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:22:59,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:59,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:59,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:59,420 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-11 14:23:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:00,044 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-01-11 14:23:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:00,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:00,046 INFO L225 Difference]: With dead ends: 93 [2019-01-11 14:23:00,046 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 14:23:00,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 14:23:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-11 14:23:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 14:23:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-01-11 14:23:00,059 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-01-11 14:23:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:00,059 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-01-11 14:23:00,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-01-11 14:23:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:00,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:00,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:00,060 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-11 14:23:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,250 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 14:23:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:00,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:00,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:00,256 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-11 14:23:00,258 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:00,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:00,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:00,261 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:23:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:00,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:00,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:00,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:00,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:00,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:23:00,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:23:00,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:23:00,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:00,422 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 14:23:00,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:23:00,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:00,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:23:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:00,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:00,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:23:00,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:23:00,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:00,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:23:00,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:23:00,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:00,517 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-01-11 14:23:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:00,559 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-01-11 14:23:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:23:00,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:23:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:00,561 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:23:00,561 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:23:00,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:23:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-11 14:23:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 14:23:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-01-11 14:23:00,579 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-01-11 14:23:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:00,579 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-01-11 14:23:00,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:23:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-01-11 14:23:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:00,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:00,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:00,579 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-01-11 14:23:00,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:00,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:00,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:00,639 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:00,639 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-11 14:23:00,639 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:00,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:00,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:00,642 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:00,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:00,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:00,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:23:00,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:00,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:00,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:00,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:00,794 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:01,680 WARN L181 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 14:23:01,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:01,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:01,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:23:01,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:01,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:01,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:01,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:01,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:01,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:01,851 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-01-11 14:23:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:02,195 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-01-11 14:23:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:02,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:02,197 INFO L225 Difference]: With dead ends: 85 [2019-01-11 14:23:02,197 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 14:23:02,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 14:23:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-01-11 14:23:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 14:23:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-01-11 14:23:02,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-01-11 14:23:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:02,213 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-01-11 14:23:02,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-01-11 14:23:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:02,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:02,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:02,214 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:02,215 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-01-11 14:23:02,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:02,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:02,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:02,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:02,380 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-01-11 14:23:02,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:02,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:02,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:02,383 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:02,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:02,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:02,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:02,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:02,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:02,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:02,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:02,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,406 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-11 14:23:02,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:02,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,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, 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-11 14:23:02,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:23:02,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:02,513 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:02,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,548 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-11 14:23:02,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:02,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:02,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,660 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-11 14:23:02,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:02,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:02,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,785 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:02,786 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-11 14:23:02,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,896 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-11 14:23:02,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:02,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:03,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:03,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:03,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:03,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:03,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:03,003 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-01-11 14:23:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:03,754 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-01-11 14:23:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:03,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:03,755 INFO L225 Difference]: With dead ends: 96 [2019-01-11 14:23:03,755 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 14:23:03,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 14:23:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-01-11 14:23:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:23:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-11 14:23:03,772 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-11 14:23:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:03,772 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-11 14:23:03,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-11 14:23:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:03,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:03,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:03,773 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:03,773 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-11 14:23:03,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,020 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-11 14:23:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:04,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:04,047 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-11 14:23:04,049 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:04,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:04,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:04,052 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:04,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:04,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:04,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:04,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:04,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:04,074 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-11 14:23:04,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:04,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:04,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:04,124 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,193 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:04,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:04,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:04,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:04,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:23:04,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:04,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:04,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:04,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:04,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:04,508 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-11 14:23:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:04,822 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-01-11 14:23:04,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:04,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:04,824 INFO L225 Difference]: With dead ends: 82 [2019-01-11 14:23:04,824 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 14:23:04,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 14:23:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-01-11 14:23:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:23:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-11 14:23:04,844 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-11 14:23:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:04,844 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-11 14:23:04,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-11 14:23:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:04,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:04,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:04,845 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-11 14:23:04,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:04,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:04,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:04,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:04,934 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-11 14:23:04,935 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:04,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:04,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:04,938 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:04,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:04,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:04,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:04,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:04,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:04,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,962 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-11 14:23:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:04,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,973 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-11 14:23:04,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,983 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-11 14:23:04,983 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:05,068 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:05,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:05,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,141 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-11 14:23:05,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:05,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,301 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-11 14:23:05,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:05,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:05,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:05,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:05,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:05,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:05,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:05,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:05,398 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-11 14:23:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:05,721 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-01-11 14:23:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:05,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:05,723 INFO L225 Difference]: With dead ends: 87 [2019-01-11 14:23:05,723 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 14:23:05,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 14:23:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-01-11 14:23:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 14:23:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-01-11 14:23:05,744 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-01-11 14:23:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:05,745 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-01-11 14:23:05,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-01-11 14:23:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:05,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:05,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:05,746 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-11 14:23:05,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:05,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:05,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:05,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:05,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:05,985 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 14:23:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:06,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:06,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:06,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:06,010 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-11 14:23:06,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:06,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:06,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:06,016 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:06,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:06,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:06,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:06,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:06,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:06,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:06,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:06,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,038 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-11 14:23:06,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:06,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,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, 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-11 14:23:06,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:06,174 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:06,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,207 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-11 14:23:06,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:06,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:06,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:06,290 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-11 14:23:06,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,333 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-11 14:23:06,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:06,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:06,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:06,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:06,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:06,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:06,397 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-01-11 14:23:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:06,721 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-01-11 14:23:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:06,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:06,723 INFO L225 Difference]: With dead ends: 86 [2019-01-11 14:23:06,723 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 14:23:06,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 14:23:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-11 14:23:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 14:23:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-01-11 14:23:06,746 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-01-11 14:23:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:06,746 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-01-11 14:23:06,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-01-11 14:23:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:06,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:06,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:06,747 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-01-11 14:23:06,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:06,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:06,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:06,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:06,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:07,034 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-11 14:23:07,337 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 14:23:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:07,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:07,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:07,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:07,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:07,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:07,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:07,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:07,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:23:07,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:07,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:07,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:07,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:07,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:07,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:07,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:07,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,436 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:07,484 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:07,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:07,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:07,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:07,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:23:07,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:07,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:07,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:07,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:07,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:07,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:07,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:07,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:07,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:07,678 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-01-11 14:23:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:08,677 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-01-11 14:23:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:08,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:08,679 INFO L225 Difference]: With dead ends: 110 [2019-01-11 14:23:08,679 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 14:23:08,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 14:23:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-01-11 14:23:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 14:23:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-01-11 14:23:08,707 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-01-11 14:23:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:08,708 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-01-11 14:23:08,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-01-11 14:23:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:08,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:08,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:08,709 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:08,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:08,709 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-11 14:23:08,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:08,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:08,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:08,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:08,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:08,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:08,830 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-01-11 14:23:08,831 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:08,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:08,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:08,834 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:23:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:08,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:08,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:08,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:08,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:08,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:08,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:08,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:08,855 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-11 14:23:08,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23: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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:08,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,873 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:08,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:08,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:08,950 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:08,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:08,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:09,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:09,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:09,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:23:09,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:09,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:23:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:23:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:09,061 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-01-11 14:23:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:09,318 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-01-11 14:23:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:09,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-11 14:23:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:09,320 INFO L225 Difference]: With dead ends: 87 [2019-01-11 14:23:09,320 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 14:23:09,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:23:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 14:23:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-11 14:23:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 14:23:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-01-11 14:23:09,340 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-01-11 14:23:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:09,341 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-01-11 14:23:09,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:23:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-01-11 14:23:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:09,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:09,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:09,342 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-01-11 14:23:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:09,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:09,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:09,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:09,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:09,480 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-01-11 14:23:09,480 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:09,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:09,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:09,483 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:09,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:09,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:09,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:09,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:09,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:09,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:09,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:09,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:09,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:09,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:09,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,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, 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-11 14:23:09,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,565 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,627 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:09,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,671 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-11 14:23:09,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:09,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,750 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:09,751 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-11 14:23:09,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:09,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,831 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-11 14:23:09,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,880 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-11 14:23:09,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:09,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-11 14:23:09,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:09,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:09,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:09,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:09,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:09,956 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-01-11 14:23:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:10,527 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-01-11 14:23:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:10,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:10,530 INFO L225 Difference]: With dead ends: 133 [2019-01-11 14:23:10,530 INFO L226 Difference]: Without dead ends: 132 [2019-01-11 14:23:10,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-11 14:23:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-01-11 14:23:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 14:23:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-01-11 14:23:10,557 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-01-11 14:23:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:10,557 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-01-11 14:23:10,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-01-11 14:23:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:10,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:10,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:10,559 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-01-11 14:23:10,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:10,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:10,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:10,702 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 14:23:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:10,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:10,710 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:10,711 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-11 14:23:10,712 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:10,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:10,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:10,715 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:10,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:10,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:10,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:10,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:10,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:10,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:10,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:10,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:10,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:10,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,766 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-11 14:23:10,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:10,836 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:10,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:10,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:10,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:10,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:23:10,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:10,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:10,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:11,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:11,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:11,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:11,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:11,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:11,034 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-01-11 14:23:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:11,368 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-01-11 14:23:11,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:11,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:11,370 INFO L225 Difference]: With dead ends: 113 [2019-01-11 14:23:11,370 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 14:23:11,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 14:23:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-01-11 14:23:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:23:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-01-11 14:23:11,394 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-01-11 14:23:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:11,394 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-01-11 14:23:11,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-01-11 14:23:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:11,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:11,395 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:23:11,395 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-01-11 14:23:11,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:11,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:11,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:11,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:11,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:11,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:11,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:11,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:11,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:11,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:11,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:11,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:11,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:11,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:11,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:11,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,552 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-11 14:23:11,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,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 23 treesize of output 37 [2019-01-11 14:23:11,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,568 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-11 14:23:11,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,578 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-11 14:23:11,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,604 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,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-11 14:23:11,682 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:11,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,748 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-11 14:23:11,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:11,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:11,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,830 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-11 14:23:11,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:11,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:11,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:23:11,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:11,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:11,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-11 14:23:12,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,071 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-11 14:23:12,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:12,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:12,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:12,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:23:12,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:12,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:23:12,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:23:12,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:12,161 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-01-11 14:23:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:12,976 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-01-11 14:23:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:12,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:23:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:12,978 INFO L225 Difference]: With dead ends: 136 [2019-01-11 14:23:12,978 INFO L226 Difference]: Without dead ends: 131 [2019-01-11 14:23:12,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:23:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-11 14:23:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-11 14:23:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:23:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 14:23:13,002 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 14:23:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:13,002 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 14:23:13,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:23:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 14:23:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:13,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:13,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:13,003 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-11 14:23:13,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:13,163 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 14:23:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:13,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:13,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:13,224 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-11 14:23:13,225 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:13,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:13,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:13,228 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:13,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:13,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:13,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:13,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:13,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:13,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:23:13,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,251 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-11 14:23:13,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:13,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,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, 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-11 14:23:13,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:13,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,339 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:13,397 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:13,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,431 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-11 14:23:13,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:13,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:13,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,507 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-11 14:23:13,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:13,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:13,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,595 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:13,596 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-11 14:23:13,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,644 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-11 14:23:13,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:13,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-11 14:23:13,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:13,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:13,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:13,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:13,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:13,722 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-01-11 14:23:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:14,207 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-01-11 14:23:14,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:14,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:14,209 INFO L225 Difference]: With dead ends: 106 [2019-01-11 14:23:14,209 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 14:23:14,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 14:23:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-01-11 14:23:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:23:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 14:23:14,231 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 14:23:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:14,231 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 14:23:14,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 14:23:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:14,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:14,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:14,232 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-01-11 14:23:14,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:14,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:14,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:14,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:14,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:14,810 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 14:23:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:14,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:14,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:14,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:14,900 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-01-11 14:23:14,900 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:14,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:14,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:14,902 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:14,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:14,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:14,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:14,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:14,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:14,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:14,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,923 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-11 14:23:14,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:14,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:14,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,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-11 14:23:14,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:15,024 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:15,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:15,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:15,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:15,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,140 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-11 14:23:15,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,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-11 14:23:15,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:15,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,230 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:15,231 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-11 14:23:15,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:15,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:15,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,334 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:15,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:15,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,382 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-11 14:23:15,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:15,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:15,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:15,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:15,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:15,495 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-11 14:23:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:16,242 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-01-11 14:23:16,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:16,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:16,244 INFO L225 Difference]: With dead ends: 131 [2019-01-11 14:23:16,245 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 14:23:16,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 14:23:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-01-11 14:23:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:23:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 14:23:16,267 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 14:23:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:16,267 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 14:23:16,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 14:23:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:16,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:16,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:16,268 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-01-11 14:23:16,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:16,496 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-11 14:23:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:16,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:16,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:16,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:16,520 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-11 14:23:16,520 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:16,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:16,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:16,524 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:16,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:16,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:16,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:16,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:16,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:16,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 18 treesize of output 21 [2019-01-11 14:23:16,543 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-11 14:23:16,554 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-11 14:23:16,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:23:16,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:23:16,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,633 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 14:23:16,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:23:16,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:23:16,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,700 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 42 [2019-01-11 14:23:16,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:23:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:16,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:16,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:16,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:16,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:16,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:16,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:16,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:16,775 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-01-11 14:23:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:17,017 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-01-11 14:23:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:17,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:17,019 INFO L225 Difference]: With dead ends: 93 [2019-01-11 14:23:17,019 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 14:23:17,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 14:23:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-01-11 14:23:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:23:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 14:23:17,050 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 14:23:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:17,050 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 14:23:17,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 14:23:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:17,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:17,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:17,051 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-01-11 14:23:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:17,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:17,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:17,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:17,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:17,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:17,260 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-01-11 14:23:17,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:17,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:17,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:17,263 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:17,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:17,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:17,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:17,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:17,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:17,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,325 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-11 14:23:17,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:23:17,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,337 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-11 14:23:17,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,345 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-11 14:23:17,345 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,427 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:17,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,640 INFO L303 Elim1Store]: Index analysis took 191 ms [2019-01-11 14:23: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-11 14:23:17,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,717 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-11 14:23:17,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:17,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,801 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:17,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23: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 38 treesize of output 97 [2019-01-11 14:23:17,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:17,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,894 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:17,895 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 100 [2019-01-11 14:23:17,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,952 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-11 14:23:17,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:23:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:17,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:18,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:18,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:18,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:18,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:18,160 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-11 14:23:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:19,108 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-01-11 14:23:19,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:19,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:19,110 INFO L225 Difference]: With dead ends: 117 [2019-01-11 14:23:19,110 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 14:23:19,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:23:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 14:23:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-01-11 14:23:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 14:23:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-01-11 14:23:19,142 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-01-11 14:23:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:19,143 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-01-11 14:23:19,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-01-11 14:23:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:19,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:19,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:19,144 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-11 14:23:19,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:19,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:19,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:19,336 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 14:23:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:19,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:19,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:19,398 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:19,398 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-11 14:23:19,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:19,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:19,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:19,402 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:19,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:19,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:19,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:19,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:19,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:19,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:19,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:19,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:19,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:19,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:19,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:19,517 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:19,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:19,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:19,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:19,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:19,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:19,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:19,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,672 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:19,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 33 treesize of output 77 [2019-01-11 14:23:19,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:19,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:19,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-11 14:23:19,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:19,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:19,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:19,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:19,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:19,783 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-01-11 14:23:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:20,237 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-01-11 14:23:20,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:20,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:20,239 INFO L225 Difference]: With dead ends: 99 [2019-01-11 14:23:20,239 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 14:23:20,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 14:23:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-01-11 14:23:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 14:23:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-01-11 14:23:20,261 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-01-11 14:23:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:20,261 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-01-11 14:23:20,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-01-11 14:23:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:20,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:20,261 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:23:20,262 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:20,262 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-01-11 14:23:20,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:20,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:20,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:20,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:20,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:20,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:20,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:20,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:20,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:20,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:20,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:20,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:23:20,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:23:20,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:23:20,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:20,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:20,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:20,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,457 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-11 14:23:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:23:20,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:20,483 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,571 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:20,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:20,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:20,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,693 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-11 14:23:20,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:20,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 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-11 14:23:20,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:20,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-11 14:23:20,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,952 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-11 14:23:20,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:20,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:21,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:21,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:23:21,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:21,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:23:21,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:23:21,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:21,050 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-01-11 14:23:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:21,781 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-01-11 14:23:21,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:21,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:23:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:21,783 INFO L225 Difference]: With dead ends: 132 [2019-01-11 14:23:21,784 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 14:23:21,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:23:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 14:23:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-01-11 14:23:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 14:23:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-01-11 14:23:21,815 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-01-11 14:23:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:21,815 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-01-11 14:23:21,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:23:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-01-11 14:23:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:21,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:21,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:21,816 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-01-11 14:23:21,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:21,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:21,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:21,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:21,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:21,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:21,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:21,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:21,893 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-11 14:23:21,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:21,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:21,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:21,897 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:21,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:21,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:21,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:21,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:21,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:21,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:21,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,920 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-11 14:23:21,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:21,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:21,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:21,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:22,040 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:22,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,073 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-11 14:23:22,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:22,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:22,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:22,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,198 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-11 14:23:22,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:22,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:22,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:22,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:22,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:22,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:22,262 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-01-11 14:23:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:22,608 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-01-11 14:23:22,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:22,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:22,610 INFO L225 Difference]: With dead ends: 87 [2019-01-11 14:23:22,610 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 14:23:22,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 14:23:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-11 14:23:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 14:23:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-01-11 14:23:22,648 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-01-11 14:23:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:22,648 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-01-11 14:23:22,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-01-11 14:23:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:22,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:22,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:22,649 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-01-11 14:23:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:22,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:22,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:22,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:22,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:22,773 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-01-11 14:23:22,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:22,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:22,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:22,776 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:22,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:22,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:22,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:22,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:22,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:22,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:22,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:22,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:22,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:23:22,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,863 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-11 14:23:22,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,878 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-11 14:23:22,878 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:22,961 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:22,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:22,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:23,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:23,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:23,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,157 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-11 14:23:23,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:23,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,216 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:23,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:23,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,278 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-11 14:23:23,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:23,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:23,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:23,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:23,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:23,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:23,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:23,377 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-01-11 14:23:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:23,838 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-01-11 14:23:23,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:23,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:23,840 INFO L225 Difference]: With dead ends: 106 [2019-01-11 14:23:23,840 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 14:23:23,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 14:23:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-01-11 14:23:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 14:23:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-01-11 14:23:23,878 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-01-11 14:23:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:23,879 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-01-11 14:23:23,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-01-11 14:23:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:23,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:23,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:23,880 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-11 14:23:23,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:23,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:23,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:23,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:23,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:24,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:24,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:24,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:24,033 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-11 14:23:24,035 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:24,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:24,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:24,038 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:24,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:24,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:24,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:24,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:24,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:24,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:24,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:24,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,103 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-11 14:23:24,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:24,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,144 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-11 14:23:24,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:24,164 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,220 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:24,250 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:24,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,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 66 [2019-01-11 14:23:24,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:24,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:24,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,363 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-11 14:23:24,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:24,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,451 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:24,452 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 104 [2019-01-11 14:23:24,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,507 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-11 14:23:24,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:24,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:24,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:24,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:24,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:24,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:24,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:24,587 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-01-11 14:23:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:25,120 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-01-11 14:23:25,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:25,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:25,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:25,122 INFO L225 Difference]: With dead ends: 102 [2019-01-11 14:23:25,122 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 14:23:25,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 14:23:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-11 14:23:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 14:23:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-11 14:23:25,153 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-11 14:23:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:25,153 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-11 14:23:25,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-11 14:23:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:25,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:25,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:25,154 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:25,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:25,154 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-01-11 14:23:25,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:25,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:25,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:25,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:25,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:25,237 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-11 14:23:25,240 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:25,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:25,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:25,242 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:25,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:25,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:25,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:25,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:25,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:25,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:25,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:25,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:23:25,269 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-11 14:23:25,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:25,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:25,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:25,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:25,371 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:25,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:25,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:25,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:25,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,570 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:25,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:23:25,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:25,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:23:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:25,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:25,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:25,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:25,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:25,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:25,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:25,656 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-01-11 14:23:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:25,930 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-01-11 14:23:25,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:25,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:25,932 INFO L225 Difference]: With dead ends: 94 [2019-01-11 14:23:25,932 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 14:23:25,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 14:23:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-01-11 14:23:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 14:23:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-11 14:23:25,978 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-11 14:23:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:25,978 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-11 14:23:25,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-11 14:23:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:25,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:25,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:25,979 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-01-11 14:23:25,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:25,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:25,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:26,490 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 14:23:26,716 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-11 14:23:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:26,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:26,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:26,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:26,741 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-01-11 14:23:26,743 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:26,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:26,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:26,745 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:26,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:26,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:26,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:26,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:26,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:26,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:26,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:26,770 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-11 14:23:26,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:26,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:26,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,795 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-11 14:23:26,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,816 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,865 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:26,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:26,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:26,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,966 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:26,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:23:26,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:23:27,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 14:23:27,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:27,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:23:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:27,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:27,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:27,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:27,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:27,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:27,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:27,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:27,141 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-01-11 14:23:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:27,540 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-01-11 14:23:27,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:27,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:27,541 INFO L225 Difference]: With dead ends: 116 [2019-01-11 14:23:27,542 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 14:23:27,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 14:23:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-01-11 14:23:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 14:23:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-01-11 14:23:27,584 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-01-11 14:23:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:27,584 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-01-11 14:23:27,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-01-11 14:23:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:27,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:27,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:27,585 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:27,585 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-01-11 14:23:27,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:27,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:27,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:27,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:27,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:27,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:27,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:27,752 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:27,753 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-01-11 14:23:27,753 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:27,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:27,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:27,756 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:27,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:27,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:27,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:27,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:27,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:27,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:27,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:27,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,787 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-11 14:23:27,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,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 23 treesize of output 37 [2019-01-11 14:23:27,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,807 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-11 14:23:27,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,816 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-11 14:23:27,817 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:27,903 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:27,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,974 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-11 14:23:27,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:28,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:28,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,058 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-11 14:23:28,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:28,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:28,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,156 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:28,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 14:23:28,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:28,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:28,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:28,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,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, 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-11 14:23:28,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,398 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-11 14:23:28,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:28,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:28,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:28,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:28,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:28,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:28,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:28,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:28,550 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-01-11 14:23:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:29,501 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-01-11 14:23:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:29,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:29,503 INFO L225 Difference]: With dead ends: 140 [2019-01-11 14:23:29,504 INFO L226 Difference]: Without dead ends: 139 [2019-01-11 14:23:29,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-11 14:23:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-01-11 14:23:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 14:23:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-01-11 14:23:29,551 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-01-11 14:23:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:29,551 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-01-11 14:23:29,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-01-11 14:23:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:29,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:29,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:29,552 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:29,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-01-11 14:23:29,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:29,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:29,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:29,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:29,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:29,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:29,609 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-11 14:23:29,610 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:29,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:29,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:29,613 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:29,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:29,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:29,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:29,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:29,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:29,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:29,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-11 14:23:29,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:29,651 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-11 14:23:29,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:23:29,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:23:29,677 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:29,736 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 14:23:29,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:23:29,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:29,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:23:29,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:23:29,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:29,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:23:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:29,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:29,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:29,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:29,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:29,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:29,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:29,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:29,866 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-01-11 14:23:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:30,135 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-01-11 14:23:30,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:30,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:30,137 INFO L225 Difference]: With dead ends: 112 [2019-01-11 14:23:30,138 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 14:23:30,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 14:23:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-01-11 14:23:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 14:23:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-01-11 14:23:30,192 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-01-11 14:23:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:30,193 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-01-11 14:23:30,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-01-11 14:23:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:30,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:30,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:30,193 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-01-11 14:23:30,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:30,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:30,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:30,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:30,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:30,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:30,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:30,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:30,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:30,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:30,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:30,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:30,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:30,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:30,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:30,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,406 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-11 14:23:30,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:30,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,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, 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-11 14:23:30,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,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-11 14:23:30,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:30,505 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:30,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,544 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-11 14:23:30,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:30,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:30,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,624 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:30,625 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-11 14:23:30,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:30,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:30,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,706 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-11 14:23:30,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:30,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:30,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,795 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:30,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:30,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,842 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-11 14:23:30,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:30,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:31,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:31,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:31,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:31,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:31,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:31,019 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-01-11 14:23:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:31,906 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-01-11 14:23:31,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:31,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:31,909 INFO L225 Difference]: With dead ends: 137 [2019-01-11 14:23:31,909 INFO L226 Difference]: Without dead ends: 135 [2019-01-11 14:23:31,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-11 14:23:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-01-11 14:23:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:23:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-01-11 14:23:31,945 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-01-11 14:23:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:31,946 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-01-11 14:23:31,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-01-11 14:23:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:31,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:31,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:31,947 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-11 14:23:31,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:31,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:31,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:32,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:32,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:32,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:32,047 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-11 14:23:32,047 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:32,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:32,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:32,049 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:32,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:32,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:32,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:32,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:32,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:32,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:32,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:32,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,074 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-11 14:23:32,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:32,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,085 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-11 14:23:32,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,095 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-11 14:23:32,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,126 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:32,183 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:32,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,216 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-11 14:23:32,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:32,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:32,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:32,290 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-11 14:23:32,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,334 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-11 14:23:32,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:32,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:23:32,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,484 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-11 14:23:32,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:32,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-11 14:23:32,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:32,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:32,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:32,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:32,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:32,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:32,554 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-01-11 14:23:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:33,031 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-11 14:23:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:33,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:33,033 INFO L225 Difference]: With dead ends: 124 [2019-01-11 14:23:33,033 INFO L226 Difference]: Without dead ends: 123 [2019-01-11 14:23:33,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-11 14:23:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-01-11 14:23:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 14:23:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-01-11 14:23:33,076 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-01-11 14:23:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:33,076 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-01-11 14:23:33,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-01-11 14:23:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:33,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:33,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:33,077 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-11 14:23:33,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:33,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:33,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:33,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:33,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:33,193 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:33,193 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-11 14:23:33,195 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:33,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:33,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:33,198 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:33,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:33,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:33,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:33,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:33,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:33,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:33,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:33,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, 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-11 14:23:33,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,221 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-11 14:23:33,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:33,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:33,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,244 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-11 14:23:33,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:33,347 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:33,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,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, 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-11 14:23:33,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:33,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:33,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,510 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:33,511 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-11 14:23:33,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:33,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:33,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,617 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:33,617 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-11 14:23:33,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,668 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-11 14:23:33,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:33,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:33,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:33,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:23:33,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:33,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:23:33,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:23:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:33,747 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-01-11 14:23:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:34,246 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-01-11 14:23:34,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:34,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:23:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:34,248 INFO L225 Difference]: With dead ends: 119 [2019-01-11 14:23:34,248 INFO L226 Difference]: Without dead ends: 118 [2019-01-11 14:23:34,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-11 14:23:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-01-11 14:23:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 14:23:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-01-11 14:23:34,296 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-01-11 14:23:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:34,296 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-01-11 14:23:34,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:23:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-01-11 14:23:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:34,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:34,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:34,297 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-01-11 14:23:34,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:34,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:34,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:34,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:34,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:34,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:34,469 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:34,469 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-01-11 14:23:34,470 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:34,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:34,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:34,473 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:34,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:34,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:34,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:34,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:34,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:34,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:34,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,498 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-11 14:23:34,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:34,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:34,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:34,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:34,598 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:34,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,632 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-11 14:23:34,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:34,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:34,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:34,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:34,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,803 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:34,804 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-11 14:23:34,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,852 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-11 14:23:34,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:34,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:34,904 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-11 14:23:34,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,951 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-11 14:23:34,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:34,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:35,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:35,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:23:35,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:35,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:35,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:35,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:35,030 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-01-11 14:23:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:36,021 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-01-11 14:23:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:36,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:36,024 INFO L225 Difference]: With dead ends: 149 [2019-01-11 14:23:36,024 INFO L226 Difference]: Without dead ends: 148 [2019-01-11 14:23:36,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:23:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-11 14:23:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-01-11 14:23:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 14:23:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-01-11 14:23:36,074 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-01-11 14:23:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:36,075 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-01-11 14:23:36,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-01-11 14:23:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:36,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:36,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:36,076 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-01-11 14:23:36,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:36,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:36,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:36,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:36,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:36,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:36,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:36,171 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:36,171 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-11 14:23:36,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:36,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:36,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:36,175 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:36,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:36,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:36,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:36,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:36,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:36,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:36,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:36,201 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-11 14:23:36,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:36,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,221 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:36,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:36,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:36,301 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:36,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:36,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:36,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:36,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:23:36,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:36,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:36,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,456 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:36,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:23:36,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:36,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:36,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:36,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:36,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:36,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:36,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:36,557 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-01-11 14:23:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:37,059 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-01-11 14:23:37,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:37,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:37,061 INFO L225 Difference]: With dead ends: 139 [2019-01-11 14:23:37,061 INFO L226 Difference]: Without dead ends: 138 [2019-01-11 14:23:37,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-11 14:23:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-01-11 14:23:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 14:23:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-01-11 14:23:37,120 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-01-11 14:23:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:37,120 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-01-11 14:23:37,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-01-11 14:23:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:37,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:37,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:37,121 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-01-11 14:23:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:37,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:37,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:37,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:37,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:37,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:37,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:37,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:37,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:37,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:37,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:37,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:37,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:37,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:37,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:37,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:37,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,319 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-11 14:23:37,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:37,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,336 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-11 14:23:37,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,347 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-11 14:23:37,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:37,428 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:37,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:37,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:37,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:37,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,543 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:37,544 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-11 14:23:37,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,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-11 14:23:37,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:37,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:37,631 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-11 14:23:37,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:37,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:37,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,717 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-11 14:23:37,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,763 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-11 14:23:37,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:37,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:37,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:37,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:37,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:37,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:37,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:37,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:37,865 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-01-11 14:23:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:38,713 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-01-11 14:23:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:38,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:38,715 INFO L225 Difference]: With dead ends: 164 [2019-01-11 14:23:38,716 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 14:23:38,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 14:23:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-01-11 14:23:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 14:23:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-01-11 14:23:38,778 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-01-11 14:23:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:38,779 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-01-11 14:23:38,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-01-11 14:23:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:38,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:38,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:38,779 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-11 14:23:38,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:38,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:38,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:38,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:38,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:38,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:38,936 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-01-11 14:23:38,937 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:38,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:38,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:38,939 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:38,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:38,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:38,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:38,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:38,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:38,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:38,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:38,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,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, 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-11 14:23:38,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:38,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,984 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-11 14:23:38,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,991 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-11 14:23:38,992 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,050 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:39,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:39,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,113 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-11 14:23:39,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:39,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:39,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:23:39,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,239 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-11 14:23:39,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:39,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:39,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:39,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:39,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:39,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:39,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:39,303 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-01-11 14:23:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:39,676 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-01-11 14:23:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:39,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:39,678 INFO L225 Difference]: With dead ends: 122 [2019-01-11 14:23:39,678 INFO L226 Difference]: Without dead ends: 121 [2019-01-11 14:23:39,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-11 14:23:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-01-11 14:23:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 14:23:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-01-11 14:23:39,732 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-01-11 14:23:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:39,732 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-01-11 14:23:39,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-01-11 14:23:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:39,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:39,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:39,733 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:39,733 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-01-11 14:23:39,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:39,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:39,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:39,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:39,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:39,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:39,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:39,860 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:39,860 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-01-11 14:23:39,861 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:39,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:39,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:39,863 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:39,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:39,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:39,863 INFO 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-11 14:23:39,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:39,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:39,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:39,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:23:39,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:39,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:23:39,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,897 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-11 14:23:39,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,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, 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-11 14:23:39,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,965 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:39,992 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:40,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,024 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-11 14:23:40,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:40,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:40,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,099 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:40,100 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-11 14:23:40,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,145 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-11 14:23:40,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:40,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,181 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-11 14:23:40,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,228 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-11 14:23:40,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:40,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:40,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:40,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:40,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:40,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:40,293 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-01-11 14:23:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:40,825 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-01-11 14:23:40,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:40,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:40,827 INFO L225 Difference]: With dead ends: 154 [2019-01-11 14:23:40,827 INFO L226 Difference]: Without dead ends: 153 [2019-01-11 14:23:40,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-11 14:23:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-11 14:23:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 14:23:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-11 14:23:40,899 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-11 14:23:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:40,899 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-11 14:23:40,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-11 14:23:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:40,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:40,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:40,901 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:40,901 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-01-11 14:23:40,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:40,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:40,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:40,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:40,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:41,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:41,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:41,022 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:41,022 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-11 14:23:41,022 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:41,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:41,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:41,024 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:41,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:41,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:41,025 INFO 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-11 14:23:41,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:41,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:41,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:41,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 18 treesize of output 21 [2019-01-11 14:23:41,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:41,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:41,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:41,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,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, 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-11 14:23:41,080 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,099 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:41,144 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:41,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:41,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:41,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:41,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:23:41,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:41,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:41,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:41,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:41,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:41,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:41,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:41,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:41,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:41,328 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-01-11 14:23:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:41,641 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-01-11 14:23:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:41,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:41,643 INFO L225 Difference]: With dead ends: 130 [2019-01-11 14:23:41,643 INFO L226 Difference]: Without dead ends: 129 [2019-01-11 14:23:41,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-11 14:23:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-11 14:23:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 14:23:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-11 14:23:41,718 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-11 14:23:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:41,718 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-11 14:23:41,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-11 14:23:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:41,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:41,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:41,719 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-01-11 14:23:41,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:41,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:41,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:41,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:41,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:41,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:41,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:41,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:41,877 INFO 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-11 14:23:41,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:41,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:41,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:41,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:41,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:41,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 18 treesize of output 21 [2019-01-11 14:23:41,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,903 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-11 14:23:41,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,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, 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-11 14:23:41,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,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, 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-11 14:23:41,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,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, 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-11 14:23:41,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:42,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:42,004 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:42,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,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, 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-11 14:23:42,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:42,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:42,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:42,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:42,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:42,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:42,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:42,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,227 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:42,228 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-11 14:23:42,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:42,275 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-11 14:23:42,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:42,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:42,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:23:42,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:42,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:23:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:23:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:42,346 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-01-11 14:23:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:42,840 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-01-11 14:23:42,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:42,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:23:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:42,842 INFO L225 Difference]: With dead ends: 160 [2019-01-11 14:23:42,842 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 14:23:42,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:23:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 14:23:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-01-11 14:23:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 14:23:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-01-11 14:23:42,911 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-01-11 14:23:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:42,911 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-01-11 14:23:42,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:23:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-01-11 14:23:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:42,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:42,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:42,912 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-01-11 14:23:42,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:42,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:42,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:42,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:42,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:42,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:42,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:42,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:42,998 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-01-11 14:23:42,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:42,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:43,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:43,002 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:23:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:43,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:43,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:43,003 INFO 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-11 14:23:43,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:43,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:43,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:43,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:43,026 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-11 14:23:43,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:43,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:43,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:43,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,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-11 14:23:43,128 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:43,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:43,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,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-11 14:23:43,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:43,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:43,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:23:43,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:23:43,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:43,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:23:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:23:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:43,235 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-01-11 14:23:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:43,339 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-01-11 14:23:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:23:43,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 14:23:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:43,341 INFO L225 Difference]: With dead ends: 121 [2019-01-11 14:23:43,341 INFO L226 Difference]: Without dead ends: 117 [2019-01-11 14:23:43,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-11 14:23:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-11 14:23:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-11 14:23:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-01-11 14:23:43,405 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-01-11 14:23:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:43,405 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-01-11 14:23:43,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:23:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-01-11 14:23:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:43,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:43,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:43,405 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-01-11 14:23:43,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:43,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:43,568 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-11 14:23:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:43,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:43,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:43,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:43,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:43,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:43,647 INFO 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-11 14:23:43,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:43,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:43,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:43,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:43,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:43,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:43,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:43,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:23:43,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,680 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-11 14:23:43,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,687 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-11 14:23:43,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:43,779 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:43,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,816 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-11 14:23:43,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:43,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:43,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:23:43,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:43,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:43,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,976 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:43,977 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 104 [2019-01-11 14:23:43,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:44,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:44,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,195 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:44,195 INFO L303 Elim1Store]: Index analysis took 148 ms [2019-01-11 14:23:44,196 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 99 [2019-01-11 14:23:44,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,330 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-11 14:23:44,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:44,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:44,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:44,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:44,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:44,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:44,428 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-01-11 14:23:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:45,320 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-01-11 14:23:45,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:45,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:45,323 INFO L225 Difference]: With dead ends: 186 [2019-01-11 14:23:45,323 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 14:23:45,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 14:23:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-01-11 14:23:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 14:23:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-01-11 14:23:45,394 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-01-11 14:23:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:45,395 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-01-11 14:23:45,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-01-11 14:23:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:45,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:45,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:45,395 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-01-11 14:23:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:45,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:45,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:45,605 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-11 14:23:45,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-11 14:23:45,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:45,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:45,631 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:45,631 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-01-11 14:23:45,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:45,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:45,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:45,635 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:45,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:45,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:45,636 INFO 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-11 14:23:45,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:45,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:45,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:45,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:45,656 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-11 14:23:45,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:45,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:45,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,687 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-11 14:23:45,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:45,751 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:45,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:45,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:45,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:45,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:23:45,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:45,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:45,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:45,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:45,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:45,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:45,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:45,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:45,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:45,916 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-01-11 14:23:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:46,250 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-01-11 14:23:46,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:46,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:46,252 INFO L225 Difference]: With dead ends: 161 [2019-01-11 14:23:46,253 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 14:23:46,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-11 14:23:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 14:23:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-01-11 14:23:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 14:23:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-01-11 14:23:46,386 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-01-11 14:23:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:46,386 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-01-11 14:23:46,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-01-11 14:23:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:46,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:46,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:46,387 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-01-11 14:23:46,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:46,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:46,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:46,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:46,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:46,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:46,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:46,533 INFO 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-11 14:23:46,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:46,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:46,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:23:46,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:46,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:46,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:46,555 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-11 14:23:46,562 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-11 14:23:46,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:23:46,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:23:46,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:46,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:46,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:46,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:46,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:46,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:46,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 14:23:46,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:23:46,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:46,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:46,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:23:46,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:46,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:46,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:46,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:46,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:23:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:46,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:46,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:46,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:46,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:46,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:46,777 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-01-11 14:23:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:47,097 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-01-11 14:23:47,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:47,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:47,100 INFO L225 Difference]: With dead ends: 172 [2019-01-11 14:23:47,100 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 14:23:47,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 14:23:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-01-11 14:23:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 14:23:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-01-11 14:23:47,184 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-01-11 14:23:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:47,184 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-01-11 14:23:47,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-01-11 14:23:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:47,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:47,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:47,186 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-01-11 14:23:47,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:47,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:47,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:47,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:47,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:47,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:47,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:47,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:47,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:47,386 INFO 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-11 14:23:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:23:47,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:23:47,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:23:47,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:47,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:47,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:47,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,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, 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-11 14:23:47,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:47,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,433 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-11 14:23:47,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:47,511 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:47,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,550 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-11 14:23:47,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:47,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:47,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,638 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:47,639 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-11 14:23:47,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:47,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:47,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:47,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:47,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:47,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,792 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:47,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,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 97 [2019-01-11 14:23:47,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,842 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-11 14:23:47,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:47,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:47,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:47,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:47,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:47,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:47,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:47,957 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-01-11 14:23:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:48,723 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-01-11 14:23:48,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:48,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:23:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:48,725 INFO L225 Difference]: With dead ends: 209 [2019-01-11 14:23:48,725 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 14:23:48,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 14:23:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-01-11 14:23:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-11 14:23:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-01-11 14:23:48,805 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-01-11 14:23:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:48,805 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-01-11 14:23:48,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-01-11 14:23:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:48,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:48,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:48,806 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-01-11 14:23:48,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:48,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:48,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:48,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:48,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:48,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:48,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:48,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:48,920 INFO 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-11 14:23:48,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:48,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:48,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:48,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:48,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:48,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:48,941 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-11 14:23:48,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:48,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:48,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,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, 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-11 14:23:48,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:48,987 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:48,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,033 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:49,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:49,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:49,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:23:49,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:49,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-11 14:23:49,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:49,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:49,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:49,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:49,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:49,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:49,333 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-01-11 14:23:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:49,829 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-01-11 14:23:49,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:49,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:49,830 INFO L225 Difference]: With dead ends: 180 [2019-01-11 14:23:49,830 INFO L226 Difference]: Without dead ends: 173 [2019-01-11 14:23:49,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:23:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-11 14:23:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-01-11 14:23:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 14:23:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-01-11 14:23:49,917 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-01-11 14:23:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:49,917 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-01-11 14:23:49,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-01-11 14:23:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:49,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:49,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:49,918 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-01-11 14:23:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:49,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:49,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:50,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:50,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:50,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:50,070 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-11 14:23:50,071 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:50,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:50,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:50,074 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:50,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:50,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:50,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:23:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:50,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:50,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:50,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:50,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,101 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-11 14:23:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:50,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:50,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:50,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,160 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:50,212 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:50,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:50,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:50,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:50,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,320 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-11 14:23:50,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:50,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:50,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,404 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:50,404 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-11 14:23:50,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,450 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-11 14:23:50,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:50,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,485 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:50,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,487 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-11 14:23:50,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,536 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-11 14:23:50,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:50,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:50,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:50,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:23:50,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:50,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:50,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:50,761 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-01-11 14:23:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:51,567 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-01-11 14:23:51,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:51,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:23:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:51,570 INFO L225 Difference]: With dead ends: 189 [2019-01-11 14:23:51,570 INFO L226 Difference]: Without dead ends: 188 [2019-01-11 14:23:51,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-11 14:23:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-01-11 14:23:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 14:23:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-01-11 14:23:51,665 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-01-11 14:23:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:51,665 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-01-11 14:23:51,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-01-11 14:23:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:51,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:51,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:51,666 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-11 14:23:51,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:51,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:51,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:51,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:51,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:51,888 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-11 14:23:51,889 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:51,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:51,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:51,892 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:51,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:51,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:51,893 INFO 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-11 14:23:51,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:51,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:51,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:51,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:51,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,913 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-11 14:23:51,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:51,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,933 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-11 14:23:51,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,941 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-11 14:23:51,941 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,032 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:52,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,069 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-11 14:23:52,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:52,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:52,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,148 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-11 14:23:52,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:52,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:52,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,242 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:52,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 14:23:52,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:52,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:52,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,327 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:52,328 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-11 14:23:52,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,375 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-11 14:23:52,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:52,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:52,456 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-11 14:23:52,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:52,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:23:52,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:52,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:23:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:23:52,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:52,476 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-01-11 14:23:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:53,246 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-01-11 14:23:53,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:53,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:23:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:53,248 INFO L225 Difference]: With dead ends: 169 [2019-01-11 14:23:53,249 INFO L226 Difference]: Without dead ends: 168 [2019-01-11 14:23:53,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-11 14:23:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-01-11 14:23:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 14:23:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-01-11 14:23:53,342 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-01-11 14:23:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:53,342 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-01-11 14:23:53,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:23:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-01-11 14:23:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:53,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:53,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:53,343 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-11 14:23:53,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:53,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:53,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:53,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:53,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:53,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:53,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:53,435 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:53,435 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-11 14:23:53,435 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:53,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:53,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:53,437 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:53,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:53,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:53,438 INFO 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-11 14:23:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:53,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:53,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:53,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:53,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, 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-11 14:23:53,462 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-11 14:23:53,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:53,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-11 14:23:53,484 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:53,555 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-11 14:23:53,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:23:53,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 14:23:53,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:53,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:53,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-11 14:23:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:53,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:53,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:53,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:53,659 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-01-11 14:23:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:53,963 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-01-11 14:23:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:53,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:23:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:53,964 INFO L225 Difference]: With dead ends: 159 [2019-01-11 14:23:53,964 INFO L226 Difference]: Without dead ends: 158 [2019-01-11 14:23:53,965 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-11 14:23:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-11 14:23:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-01-11 14:23:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-11 14:23:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-01-11 14:23:54,061 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-01-11 14:23:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:54,062 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-01-11 14:23:54,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-01-11 14:23:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:54,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:54,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:54,062 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-01-11 14:23:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:54,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:54,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:54,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:54,455 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-11 14:23:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:54,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:54,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:54,567 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-01-11 14:23:54,567 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:54,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:54,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:54,570 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:23:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:54,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:54,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:54,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:23:54,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:54,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:54,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:54,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:54,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,596 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-11 14:23:54,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,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-11 14:23:54,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,642 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-11 14:23:54,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:54,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,756 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-11 14:23:54,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:54,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,830 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-11 14:23:54,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:54,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:54,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,910 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:54,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,911 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-11 14:23:54,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:54,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:54,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:55,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 14:23:55,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:55,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:23:55,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,105 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:55,106 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-11 14:23:55,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,153 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-11 14:23:55,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:23:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:55,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:55,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:55,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 14:23:55,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:55,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:23:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:23:55,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:23:55,259 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-01-11 14:23:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:56,493 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-01-11 14:23:56,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:56,494 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 14:23:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:56,496 INFO L225 Difference]: With dead ends: 199 [2019-01-11 14:23:56,496 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 14:23:56,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:23:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 14:23:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-01-11 14:23:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 14:23:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-11 14:23:56,588 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-11 14:23:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:56,589 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-11 14:23:56,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:23:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-11 14:23:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:56,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:56,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:56,589 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-01-11 14:23:56,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:56,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:56,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:56,765 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-11 14:23:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:56,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:56,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:56,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:56,841 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-01-11 14:23:56,843 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:56,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:56,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:56,846 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:56,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:56,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:56,847 INFO 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-11 14:23:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:56,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:56,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:56,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:56,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:56,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,889 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:23:56,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,899 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-11 14:23:56,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:56,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:56,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:56,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:56,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:56,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:56,963 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:23:57,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:57,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:57,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:23:57,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,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 59 [2019-01-11 14:23:57,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:57,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:23:57,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,116 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:57,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:23:57,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:57,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:23:57,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,179 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:57,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 35 treesize of output 75 [2019-01-11 14:23:57,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:57,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:23:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:57,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:57,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:57,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:57,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:57,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:57,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:57,303 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-01-11 14:23:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:57,954 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-01-11 14:23:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:57,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:23:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:57,956 INFO L225 Difference]: With dead ends: 181 [2019-01-11 14:23:57,956 INFO L226 Difference]: Without dead ends: 180 [2019-01-11 14:23:57,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-11 14:23:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-01-11 14:23:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 14:23:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-11 14:23:58,057 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-11 14:23:58,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:58,058 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-11 14:23:58,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-11 14:23:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:58,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:58,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:58,058 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:58,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-01-11 14:23:58,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:58,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:58,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:58,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:58,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:58,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:58,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:58,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:58,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:58,280 INFO 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-11 14:23:58,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:58,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:58,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:23:58,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:58,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:58,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:23:58,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,311 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-11 14:23:58,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:23:58,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,324 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-11 14:23:58,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,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, 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-11 14:23:58,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,363 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,415 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:23:58,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,454 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-11 14:23:58,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:58,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:23:58,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:23:58,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:58,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:58,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,625 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:58,626 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-11 14:23:58,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:58,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:58,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,719 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:58,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:58,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:58,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:23:58,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,803 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:58,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,804 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-11 14:23:58,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,853 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-11 14:23:58,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:23:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:58,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:59,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:59,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 14:23:59,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:59,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:23:59,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:23:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:23:59,011 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-01-11 14:24:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:00,311 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-01-11 14:24:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:00,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 14:24:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:00,314 INFO L225 Difference]: With dead ends: 200 [2019-01-11 14:24:00,314 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 14:24:00,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:24:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 14:24:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-01-11 14:24:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-11 14:24:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-01-11 14:24:00,411 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-01-11 14:24:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:00,411 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-01-11 14:24:00,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:24:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-01-11 14:24:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:00,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:00,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:00,412 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-01-11 14:24:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:00,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:00,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:00,557 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 14:24:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:00,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:00,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:00,622 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:00,623 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-11 14:24:00,623 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:00,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:00,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:00,625 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:00,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:00,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:00,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 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-11 14:24:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:00,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:00,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:00,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:00,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,649 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-11 14:24:00,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,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, 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-11 14:24:00,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,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, 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-11 14:24:00,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,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, 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-11 14:24:00,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:00,749 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:00,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,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, 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-11 14:24:00,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:00,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:00,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,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, 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-11 14:24:00,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:00,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:00,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:00,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,950 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-11 14:24:00,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,001 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-11 14:24:01,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:01,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:01,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:01,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:01,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:01,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:01,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:01,079 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-01-11 14:24:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:01,633 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-01-11 14:24:01,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:01,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:01,636 INFO L225 Difference]: With dead ends: 160 [2019-01-11 14:24:01,636 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 14:24:01,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 14:24:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-01-11 14:24:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 14:24:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-01-11 14:24:01,739 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-01-11 14:24:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:01,739 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-01-11 14:24:01,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-01-11 14:24:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:01,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:01,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:01,740 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-01-11 14:24:01,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:01,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:01,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:01,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:01,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:01,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:01,875 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:01,876 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-11 14:24:01,876 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:01,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:01,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:01,879 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:24:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:01,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:01,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:01,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:24:01,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:01,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:01,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:01,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:01,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,912 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-11 14:24:01,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:01,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,929 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-11 14:24:01,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:01,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:02,028 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:02,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,063 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-11 14:24:02,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:02,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:02,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,138 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-11 14:24:02,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,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-11 14:24:02,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:02,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,225 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:02,225 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 104 [2019-01-11 14:24:02,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,275 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-11 14:24:02,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:02,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,312 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:02,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:02,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,361 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-11 14:24:02,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:02,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:02,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:02,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:24:02,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:02,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:24:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:24:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:02,454 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-01-11 14:24:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:03,249 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-01-11 14:24:03,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:03,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:24:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:03,252 INFO L225 Difference]: With dead ends: 197 [2019-01-11 14:24:03,252 INFO L226 Difference]: Without dead ends: 196 [2019-01-11 14:24:03,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:24:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-11 14:24:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-01-11 14:24:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-11 14:24:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-01-11 14:24:03,362 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-01-11 14:24:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:03,363 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-01-11 14:24:03,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:24:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-01-11 14:24:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:03,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:03,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:03,364 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-01-11 14:24:03,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:03,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:03,858 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-11 14:24:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:03,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:03,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:03,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:03,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:03,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:03,970 INFO 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-11 14:24:03,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:03,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:03,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:03,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:03,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:03,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:24:04,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:24:04,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:04,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,027 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-11 14:24:04,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,040 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-11 14:24:04,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:04,197 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:04,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,234 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-11 14:24:04,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:04,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:04,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,305 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:04,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, 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-11 14:24:04,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:04,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,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 40 treesize of output 82 [2019-01-11 14:24:04,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:04,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:04,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,480 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:04,481 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-11 14:24:04,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,529 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-11 14:24:04,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:04,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:04,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:04,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:24:04,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:04,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:04,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:04,627 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-01-11 14:24:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:05,451 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-01-11 14:24:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:05,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:24:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:05,453 INFO L225 Difference]: With dead ends: 195 [2019-01-11 14:24:05,454 INFO L226 Difference]: Without dead ends: 189 [2019-01-11 14:24:05,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:24:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-11 14:24:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-01-11 14:24:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-11 14:24:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-01-11 14:24:05,562 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-01-11 14:24:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:05,562 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-01-11 14:24:05,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-01-11 14:24:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:05,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:05,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:05,563 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:05,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-01-11 14:24:05,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:05,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:05,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:05,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:05,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:05,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:05,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:05,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:05,730 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-11 14:24:05,732 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:05,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:05,735 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:05,735 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:05,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:05,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:05,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:24:05,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:05,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:05,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:05,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:05,756 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-11 14:24:05,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:24:05,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:24:05,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,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, 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-11 14:24:05,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:05,849 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:24:05,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:24:05,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:05,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:05,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,939 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:05,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:24:05,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:05,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:24:05,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:24:05,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:06,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:06,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:24:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:06,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:06,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:06,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:06,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:06,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:06,113 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-01-11 14:24:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:06,617 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-01-11 14:24:06,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:06,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:06,619 INFO L225 Difference]: With dead ends: 157 [2019-01-11 14:24:06,620 INFO L226 Difference]: Without dead ends: 156 [2019-01-11 14:24:06,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-11 14:24:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-01-11 14:24:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 14:24:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-01-11 14:24:06,760 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-01-11 14:24:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:06,760 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-01-11 14:24:06,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-01-11 14:24:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:06,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:06,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:06,761 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-01-11 14:24:06,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:06,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:06,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:06,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:06,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:06,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:06,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:06,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:06,924 INFO 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-11 14:24:06,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:06,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:06,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:06,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:06,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:06,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:06,956 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-11 14:24:06,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:24:06,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:24:06,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,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, 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-11 14:24:06,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,011 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:07,057 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:24:07,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:24:07,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:07,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:07,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:24:07,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:07,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-11 14:24:07,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:24:07,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:07,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 14:24:07,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:07,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:24:07,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:07,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:24:07,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-11 14:24:07,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:07,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:07,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:24:07,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:07,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:07,404 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-01-11 14:24:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:08,037 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-01-11 14:24:08,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:08,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:24:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:08,039 INFO L225 Difference]: With dead ends: 178 [2019-01-11 14:24:08,040 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 14:24:08,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:24:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 14:24:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-01-11 14:24:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-11 14:24:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-01-11 14:24:08,143 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-01-11 14:24:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:08,143 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-01-11 14:24:08,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-01-11 14:24:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:08,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:08,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:08,144 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-01-11 14:24:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:08,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:08,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:08,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:08,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:08,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:08,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:08,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:08,323 INFO 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-11 14:24:08,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:08,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:08,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:08,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:08,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:08,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:08,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,348 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-11 14:24:08,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:08,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,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-11 14:24:08,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,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-11 14:24:08,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,398 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:08,449 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,486 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-11 14:24:08,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:08,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:08,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,558 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:08,559 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-11 14:24:08,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:08,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:08,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,640 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 90 [2019-01-11 14:24:08,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:08,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:08,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,729 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:08,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-11 14:24:08,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,777 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-11 14:24:08,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:08,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:08,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:08,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:24:08,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:08,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:08,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:08,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:08,877 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-01-11 14:24:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:09,865 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-01-11 14:24:09,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:24:09,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:24:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:09,868 INFO L225 Difference]: With dead ends: 204 [2019-01-11 14:24:09,868 INFO L226 Difference]: Without dead ends: 203 [2019-01-11 14:24:09,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:24:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-11 14:24:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-01-11 14:24:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-11 14:24:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-01-11 14:24:09,978 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-01-11 14:24:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:09,978 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-01-11 14:24:09,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-01-11 14:24:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:09,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:09,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:09,980 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:09,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-01-11 14:24:09,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:09,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:09,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:09,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:09,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:10,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:10,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:10,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:10,109 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-11 14:24:10,110 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:10,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:10,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:10,111 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:10,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:10,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:10,112 INFO 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-11 14:24:10,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:10,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:10,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:10,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:10,133 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-11 14:24:10,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:24:10,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:24:10,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:10,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:10,229 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:24:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24: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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:24:10,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:10,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:10,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,320 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:10,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:24:10,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:10,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:24:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 14:24:10,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:10,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:24:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:10,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:10,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:10,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:24:10,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:10,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:10,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:10,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:10,529 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-01-11 14:24:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:11,092 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-01-11 14:24:11,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:11,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:11,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:11,095 INFO L225 Difference]: With dead ends: 178 [2019-01-11 14:24:11,095 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 14:24:11,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 14:24:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-01-11 14:24:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 14:24:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-01-11 14:24:11,189 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-01-11 14:24:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:11,189 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-01-11 14:24:11,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-01-11 14:24:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:11,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:11,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:11,190 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-01-11 14:24:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:11,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:11,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:11,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:11,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:11,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:11,260 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-01-11 14:24:11,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:11,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:11,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:11,263 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:11,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:11,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:11,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:24:11,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:11,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:11,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:11,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:11,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, 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-11 14:24:11,448 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-11 14:24:11,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,559 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-11 14:24:11,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:24:11,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:24:11,571 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:11,627 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 14:24:11,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:24:11,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:11,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:11,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:24:11,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:11,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:24:11,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-11 14:24:11,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:11,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:11,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:11,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:11,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:11,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:11,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:11,766 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-01-11 14:24:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:12,107 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-01-11 14:24:12,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:12,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:24:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:12,109 INFO L225 Difference]: With dead ends: 134 [2019-01-11 14:24:12,109 INFO L226 Difference]: Without dead ends: 133 [2019-01-11 14:24:12,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:24:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-11 14:24:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-01-11 14:24:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 14:24:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-11 14:24:12,212 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-11 14:24:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:12,212 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-11 14:24:12,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-11 14:24:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:12,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:12,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:12,213 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-01-11 14:24:12,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:12,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:12,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:12,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:12,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:12,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:12,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:12,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:12,363 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-01-11 14:24:12,363 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:12,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:12,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:12,366 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:12,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:12,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:12,366 INFO 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-11 14:24:12,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:12,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:12,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:12,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:12,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:24:12,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:24:12,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,407 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-11 14:24:12,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,416 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-11 14:24:12,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,444 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:12,497 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:12,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,528 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-11 14:24:12,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:12,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:12,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 14:24:12,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:12,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:12,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:12,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:12,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:12,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:12,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:12,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:12,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:12,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:12,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:12,844 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-11 14:24:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:13,426 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-01-11 14:24:13,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:13,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:13,428 INFO L225 Difference]: With dead ends: 143 [2019-01-11 14:24:13,428 INFO L226 Difference]: Without dead ends: 142 [2019-01-11 14:24:13,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-11 14:24:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-01-11 14:24:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 14:24:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-11 14:24:13,530 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-11 14:24:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:13,530 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-11 14:24:13,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-11 14:24:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:13,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:13,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:13,531 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-01-11 14:24:13,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:13,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:13,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:13,774 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-11 14:24:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:13,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:13,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:13,804 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-01-11 14:24:13,805 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:13,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:13,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:13,807 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:13,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:13,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:13,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 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-11 14:24:13,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:13,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:13,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:13,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:13,827 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-11 14:24:13,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, 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-11 14:24:13,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:24:13,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:24:13,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:13,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:13,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:13,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:13,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:13,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:13,928 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 14:24:13,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:24:13,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:13,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:13,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:13,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:13,995 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-11 14:24:13,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:14,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:14,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:14,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:14,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-11 14:24:14,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:14,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:14,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:24:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:14,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:14,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:14,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:24:14,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:14,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:14,112 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-11 14:24:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:14,665 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-01-11 14:24:14,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:14,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:14,668 INFO L225 Difference]: With dead ends: 151 [2019-01-11 14:24:14,668 INFO L226 Difference]: Without dead ends: 150 [2019-01-11 14:24:14,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-11 14:24:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-01-11 14:24:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 14:24:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-01-11 14:24:14,775 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-01-11 14:24:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:14,775 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-01-11 14:24:14,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-01-11 14:24:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:14,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:14,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:14,776 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-01-11 14:24:14,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:14,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:14,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:14,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:14,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:14,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:14,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:14,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:14,947 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-11 14:24:14,948 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:14,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:14,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:14,951 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:24:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:14,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:14,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:14,951 INFO 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-11 14:24:14,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:14,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:14,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:14,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:14,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,970 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-11 14:24:14,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:14,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:24:14,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:14,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:14,987 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:15,069 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:15,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,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, 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-11 14:24:15,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:15,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:15,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:15,289 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-11 14:24:15,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:15,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:15,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,376 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:15,377 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-11 14:24:15,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:15,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:15,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:15,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:15,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:15,503 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-11 14:24:15,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:15,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:15,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:15,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:24:15,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:15,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:15,588 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-01-11 14:24:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:16,407 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-01-11 14:24:16,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:16,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:24:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:16,410 INFO L225 Difference]: With dead ends: 215 [2019-01-11 14:24:16,410 INFO L226 Difference]: Without dead ends: 214 [2019-01-11 14:24:16,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:24:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-11 14:24:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-01-11 14:24:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-11 14:24:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-01-11 14:24:16,541 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-01-11 14:24:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:16,541 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-01-11 14:24:16,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-01-11 14:24:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:16,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:16,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:16,542 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:16,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-11 14:24:16,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:16,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:16,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:16,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:16,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:16,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:16,586 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-11 14:24:16,588 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:16,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:16,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:16,591 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:24:16,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:16,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:16,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:16,591 INFO 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-11 14:24:16,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:16,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:16,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:16,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:16,624 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-11 14:24:16,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:24:16,644 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-11 14:24:16,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:16,669 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,719 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-11 14:24:16,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 14:24:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 14:24:16,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:24:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:16,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:16,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:24:16,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:24:16,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:24:16,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:24:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:24:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:24:16,839 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-01-11 14:24:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:17,169 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-01-11 14:24:17,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:24:17,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 14:24:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:17,173 INFO L225 Difference]: With dead ends: 280 [2019-01-11 14:24:17,173 INFO L226 Difference]: Without dead ends: 275 [2019-01-11 14:24:17,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:24:17,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-11 14:24:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-01-11 14:24:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-11 14:24:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-01-11 14:24:17,429 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-01-11 14:24:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:17,429 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-01-11 14:24:17,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:24:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-01-11 14:24:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:17,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:17,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:17,430 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-01-11 14:24:17,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:17,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:17,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:18,011 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-11 14:24:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:18,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:18,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:18,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:18,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:18,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:18,080 INFO 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-11 14:24:18,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:18,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:18,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:18,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:18,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:18,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:18,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,110 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-11 14:24:18,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:24:18,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:24:18,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:18,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:18,205 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:18,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:18,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:18,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,319 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-11 14:24:18,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:18,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:18,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,406 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:18,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:18,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:18,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:18,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:18,494 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:18,494 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-11 14:24:18,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:18,541 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-11 14:24:18,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:18,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:18,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:18,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:24:18,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:18,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:24:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:24:18,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:18,634 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-01-11 14:24:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:19,679 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-01-11 14:24:19,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:19,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:24:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:19,682 INFO L225 Difference]: With dead ends: 329 [2019-01-11 14:24:19,682 INFO L226 Difference]: Without dead ends: 328 [2019-01-11 14:24:19,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:24:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-11 14:24:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-01-11 14:24:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-11 14:24:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-01-11 14:24:19,954 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-01-11 14:24:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:19,954 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-01-11 14:24:19,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:24:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-01-11 14:24:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:19,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:19,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:19,956 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-11 14:24:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:19,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:19,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:20,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:20,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:20,088 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:20,088 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-11 14:24:20,089 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:20,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:20,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:20,091 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:20,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:20,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:20,091 INFO 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-11 14:24:20,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:20,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:20,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:20,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:20,121 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-11 14:24:20,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:24:20,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,133 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:24:20,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,145 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-11 14:24:20,145 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:20,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:20,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:20,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:20,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:20,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:20,210 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:24:20,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:24:20,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:20,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:20,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:20,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:20,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:24:20,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:20,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:20,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:20,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:20,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:20,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:20,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:20,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:20,414 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-01-11 14:24:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:20,969 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-01-11 14:24:20,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:20,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:24:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:20,973 INFO L225 Difference]: With dead ends: 290 [2019-01-11 14:24:20,973 INFO L226 Difference]: Without dead ends: 286 [2019-01-11 14:24:20,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-11 14:24:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-01-11 14:24:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-11 14:24:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-01-11 14:24:21,245 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-01-11 14:24:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:21,246 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-01-11 14:24:21,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-01-11 14:24:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:21,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:21,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:21,247 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-01-11 14:24:21,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:21,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:21,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:21,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:21,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:21,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:21,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:21,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:21,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:21,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:21,353 INFO 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-11 14:24:21,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:21,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:21,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:21,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:21,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:21,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 18 treesize of output 21 [2019-01-11 14:24:21,377 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-11 14:24:21,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:24:21,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:24:21,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:24:21,405 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:21,460 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 14:24:21,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:24:21,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:21,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:21,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,528 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:21,529 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 42 [2019-01-11 14:24:21,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:21,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:21,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:21,570 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-11 14:24:21,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:21,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:21,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:21,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:21,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:21,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:21,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:21,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:21,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:21,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:21,655 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-01-11 14:24:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:22,261 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-01-11 14:24:22,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:22,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:22,265 INFO L225 Difference]: With dead ends: 307 [2019-01-11 14:24:22,265 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 14:24:22,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 14:24:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-01-11 14:24:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-11 14:24:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-01-11 14:24:22,528 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-01-11 14:24:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:22,528 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-01-11 14:24:22,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-01-11 14:24:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:22,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:22,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:22,529 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:22,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:22,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-01-11 14:24:22,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:22,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:22,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:22,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:22,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:22,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:22,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:22,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:22,762 INFO 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-11 14:24:22,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:24:22,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:24:22,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:24:22,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:22,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:22,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:22,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:24:22,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:22,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,805 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-11 14:24:22,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,814 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-11 14:24:22,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:22,842 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:22,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:22,867 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:22,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:22,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:22,895 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:22,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:22,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, 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-11 14:24:22,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:22,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:22,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:23,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,015 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:23,016 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-11 14:24:23,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:23,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-11 14:24:23,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:23,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,101 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:23,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, 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-11 14:24:23,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:23,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:23,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:23,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,185 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-11 14:24:23,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:23,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:23,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:23,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,265 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:23,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,267 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-11 14:24:23,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:23,315 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-11 14:24:23,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:23,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:23,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:23,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 14:24:23,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:23,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:24:23,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:24:23,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:24:23,452 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-01-11 14:24:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:24,760 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-01-11 14:24:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:24,760 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 14:24:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:24,763 INFO L225 Difference]: With dead ends: 284 [2019-01-11 14:24:24,763 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 14:24:24,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:24:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 14:24:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-01-11 14:24:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-11 14:24:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-01-11 14:24:25,014 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-01-11 14:24:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:25,014 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-01-11 14:24:25,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:24:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-01-11 14:24:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:25,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:25,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:25,015 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-01-11 14:24:25,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:25,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:25,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:25,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:25,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:25,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:25,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:25,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:25,079 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-11 14:24:25,080 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:25,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:25,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:25,082 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:25,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:25,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:25,083 INFO 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-11 14:24:25,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:25,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:25,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:25,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:24:25,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,109 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-11 14:24:25,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:25,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,125 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-11 14:24:25,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,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, 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-11 14:24:25,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,162 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:25,216 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:25,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:24:25,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,288 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-11 14:24:25,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:25,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,323 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-11 14:24:25,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,369 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-11 14:24:25,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:25,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:25,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:25,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:24:25,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:25,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:25,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:25,417 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-01-11 14:24:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:25,954 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-01-11 14:24:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:25,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:24:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:25,957 INFO L225 Difference]: With dead ends: 230 [2019-01-11 14:24:25,957 INFO L226 Difference]: Without dead ends: 223 [2019-01-11 14:24:25,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-11 14:24:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-01-11 14:24:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-11 14:24:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-01-11 14:24:26,219 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-01-11 14:24:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:26,219 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-01-11 14:24:26,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-01-11 14:24:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:26,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:26,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:26,220 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-01-11 14:24:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:26,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:26,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:26,361 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-11 14:24:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:26,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:26,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:26,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:26,381 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-01-11 14:24:26,382 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:26,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:26,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:26,385 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:26,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:26,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:26,386 INFO 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-11 14:24:26,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:26,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:26,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:26,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:26,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:24:26,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:24:26,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:24:26,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,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, 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-11 14:24:26,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:26,524 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:26,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,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 72 [2019-01-11 14:24:26,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:26,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:26,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:26,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,678 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-11 14:24:26,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:26,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:26,714 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 104 [2019-01-11 14:24:26,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,770 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-11 14:24:26,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:26,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:26,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:26,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 14:24:26,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:26,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:24:26,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:24:26,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:24:26,830 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-01-11 14:24:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:27,493 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-01-11 14:24:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:27,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 14:24:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:27,496 INFO L225 Difference]: With dead ends: 254 [2019-01-11 14:24:27,496 INFO L226 Difference]: Without dead ends: 253 [2019-01-11 14:24:27,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-11 14:24:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-01-11 14:24:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-11 14:24:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-01-11 14:24:27,783 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-01-11 14:24:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:27,783 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-01-11 14:24:27,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:24:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-01-11 14:24:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:27,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:27,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:27,784 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:27,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-01-11 14:24:27,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:27,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:27,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:28,001 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 14:24:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:28,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:28,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:28,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:28,012 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-11 14:24:28,012 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:28,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:28,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:28,014 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:28,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:28,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:28,014 INFO 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-11 14:24:28,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:28,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:28,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:28,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,046 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-11 14:24:28,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:24:28,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,065 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-11 14:24:28,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,072 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-11 14:24:28,073 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,100 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:28,153 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:28,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,184 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-11 14:24:28,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:28,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:28,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,257 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:28,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:28,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:28,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:28,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:28,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:28,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:24:28,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:28,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:24:28,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:24:28,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:28,356 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-01-11 14:24:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:28,820 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-01-11 14:24:28,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:28,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 14:24:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:28,822 INFO L225 Difference]: With dead ends: 223 [2019-01-11 14:24:28,822 INFO L226 Difference]: Without dead ends: 216 [2019-01-11 14:24:28,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:24:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-11 14:24:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-01-11 14:24:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-11 14:24:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-01-11 14:24:29,106 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-01-11 14:24:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:29,106 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-01-11 14:24:29,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:24:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-01-11 14:24:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:29,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:29,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:29,107 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-01-11 14:24:29,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:29,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:29,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:29,319 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-11 14:24:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:29,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:29,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:29,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:29,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:29,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:29,433 INFO 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-11 14:24:29,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:24:29,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:24:29,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:24:29,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:29,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:29,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:29,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,454 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-11 14:24:29,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:29,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:24:29,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,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, 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-11 14:24:29,474 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,526 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:29,554 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:29,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,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-11 14:24:29,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:29,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:29,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:29,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,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-11 14:24:29,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:29,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,834 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:29,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 98 [2019-01-11 14:24:29,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:29,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:29,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:29,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:29,963 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-11 14:24:29,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,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-11 14:24:30,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:30,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:30,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:30,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:24:30,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:30,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:30,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:30,158 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-01-11 14:24:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:31,218 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-01-11 14:24:31,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:31,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:24:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:31,222 INFO L225 Difference]: With dead ends: 285 [2019-01-11 14:24:31,222 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 14:24:31,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:24:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 14:24:31,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-01-11 14:24:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 14:24:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-01-11 14:24:31,488 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-01-11 14:24:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:31,488 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-01-11 14:24:31,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-01-11 14:24:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:31,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:31,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:31,489 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:31,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-01-11 14:24:31,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:31,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:31,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:31,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:31,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:31,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:31,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:31,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:31,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:31,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:31,605 INFO 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-11 14:24:31,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:31,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:31,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:31,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:31,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:31,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:31,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,632 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-11 14:24:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:31,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,646 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-11 14:24:31,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,656 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-11 14:24:31,656 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:31,736 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:31,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,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, 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-11 14:24:31,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:31,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:31,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,846 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:31,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:31,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:31,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:31,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,188 INFO L303 Elim1Store]: Index analysis took 276 ms [2019-01-11 14:24:32,189 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-11 14:24:32,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,233 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-11 14:24:32,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:32,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:32,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:32,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:32,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:32,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:32,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:32,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:32,303 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-01-11 14:24:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:33,065 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-01-11 14:24:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:33,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:33,069 INFO L225 Difference]: With dead ends: 252 [2019-01-11 14:24:33,069 INFO L226 Difference]: Without dead ends: 247 [2019-01-11 14:24:33,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-11 14:24:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-01-11 14:24:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-11 14:24:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-01-11 14:24:33,351 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-01-11 14:24:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:33,352 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-01-11 14:24:33,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-01-11 14:24:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:33,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:33,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:33,352 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:33,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-11 14:24:33,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:33,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:33,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:33,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:33,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:33,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:33,424 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-11 14:24:33,425 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:33,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:33,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:33,426 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:33,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:33,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:33,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:33,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:33,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:33,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:33,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:33,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,448 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-11 14:24:33,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,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, 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-11 14:24:33,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,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, 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-11 14:24:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,476 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-11 14:24:33,477 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:33,558 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:33,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,589 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-11 14:24:33,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:33,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:33,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,663 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-11 14:24:33,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,708 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-11 14:24:33,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:33,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:33,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:33,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:24:33,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:33,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:24:33,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:24:33,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:33,768 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-01-11 14:24:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:34,241 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-01-11 14:24:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:34,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 14:24:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:34,243 INFO L225 Difference]: With dead ends: 194 [2019-01-11 14:24:34,243 INFO L226 Difference]: Without dead ends: 193 [2019-01-11 14:24:34,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:24:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-11 14:24:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-11 14:24:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-11 14:24:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-01-11 14:24:34,513 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-01-11 14:24:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:34,513 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-01-11 14:24:34,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:24:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-01-11 14:24:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:34,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:34,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:34,514 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-01-11 14:24:34,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:34,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:34,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:34,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:34,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:34,935 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-11 14:24:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:35,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:35,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:35,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:35,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:35,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:35,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:35,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:35,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:35,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:35,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:35,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:35,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:35,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:24:35,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:24:35,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:24:35,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:35,064 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:35,128 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:24:35,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,293 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-11 14:24:35,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:24:35,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:35,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:35,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:24:35,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:35,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:35,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,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 33 treesize of output 76 [2019-01-11 14:24:35,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:35,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:24:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:35,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:35,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:35,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:35,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:35,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:35,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:35,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:35,514 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-01-11 14:24:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:36,317 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-01-11 14:24:36,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:36,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:36,321 INFO L225 Difference]: With dead ends: 265 [2019-01-11 14:24:36,322 INFO L226 Difference]: Without dead ends: 264 [2019-01-11 14:24:36,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-11 14:24:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-01-11 14:24:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 14:24:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-01-11 14:24:36,649 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-01-11 14:24:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:36,649 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-01-11 14:24:36,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-01-11 14:24:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:36,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:36,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:36,650 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-01-11 14:24:36,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:36,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:36,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:36,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:36,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:36,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:36,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:36,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:36,717 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-11 14:24:36,718 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:36,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:36,720 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:36,720 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:36,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:36,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:36,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:36,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:36,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:36,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:36,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:24:36,746 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-11 14:24:36,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:24:36,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:24:36,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:24:36,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:36,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 14:24:36,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:24:36,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:36,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:36,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,909 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:36,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-11 14:24:36,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:36,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:36,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:36,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:36,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:24:36,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:36,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:24:36,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:24:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:36,982 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-01-11 14:24:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:37,456 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-01-11 14:24:37,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:37,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 14:24:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:37,457 INFO L225 Difference]: With dead ends: 210 [2019-01-11 14:24:37,458 INFO L226 Difference]: Without dead ends: 203 [2019-01-11 14:24:37,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:24:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-11 14:24:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-11 14:24:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 14:24:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-01-11 14:24:37,781 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-01-11 14:24:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:37,781 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-01-11 14:24:37,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:24:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-01-11 14:24:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:37,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:37,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:37,782 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-01-11 14:24:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:37,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:37,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:37,923 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-11 14:24:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:37,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:37,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:37,941 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:37,942 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-01-11 14:24:37,942 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:37,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:37,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:37,944 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:37,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:37,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:37,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:37,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:37,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:37,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:37,962 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-11 14:24:37,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:24:37,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,975 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:24:37,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:37,987 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:38,052 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:24:38,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:24:38,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:38,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:38,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:24:38,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:38,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:24:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:38,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:38,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:38,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:24:38,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:38,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:24:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:24:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:38,237 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-01-11 14:24:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:38,786 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-01-11 14:24:38,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:38,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 14:24:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:38,788 INFO L225 Difference]: With dead ends: 216 [2019-01-11 14:24:38,788 INFO L226 Difference]: Without dead ends: 212 [2019-01-11 14:24:38,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:24:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-11 14:24:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-01-11 14:24:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-11 14:24:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-01-11 14:24:39,130 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-01-11 14:24:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:39,131 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-01-11 14:24:39,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:24:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-01-11 14:24:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:39,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:39,131 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:39,132 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-01-11 14:24:39,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:39,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:39,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:39,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:39,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:39,407 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-11 14:24:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:39,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:39,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:39,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:39,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:39,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:39,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:39,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:39,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:39,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:39,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:39,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:39,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:39,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,522 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-11 14:24:39,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:39,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:24:39,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:39,546 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,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-11 14:24:39,626 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:39,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,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, 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-11 14:24:39,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:39,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:39,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,730 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-11 14:24:39,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:39,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:39,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,810 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-11 14:24:39,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:39,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:39,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:39,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:39,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:24:39,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:39,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:39,920 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-01-11 14:24:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:40,965 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-01-11 14:24:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:40,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:24:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:40,968 INFO L225 Difference]: With dead ends: 401 [2019-01-11 14:24:40,968 INFO L226 Difference]: Without dead ends: 397 [2019-01-11 14:24:40,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-11 14:24:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-01-11 14:24:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-11 14:24:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-01-11 14:24:41,571 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-01-11 14:24:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:41,571 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-01-11 14:24:41,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-01-11 14:24:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:41,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:41,572 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:41,572 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:41,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-01-11 14:24:41,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:41,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:41,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:41,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:41,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:41,626 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-11 14:24:41,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:24:41,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:24:41,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:24:41,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:24:41,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:24:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:24:41,627 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-01-11 14:24:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:42,236 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-01-11 14:24:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:24:42,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-11 14:24:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:42,239 INFO L225 Difference]: With dead ends: 347 [2019-01-11 14:24:42,239 INFO L226 Difference]: Without dead ends: 342 [2019-01-11 14:24:42,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:24:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-11 14:24:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-11 14:24:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-11 14:24:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-01-11 14:24:42,865 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-01-11 14:24:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:42,865 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-01-11 14:24:42,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:24:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-01-11 14:24:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:42,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:42,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:42,866 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-01-11 14:24:42,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:42,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:42,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:43,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:43,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:43,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:24:43,055 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-11 14:24:43,056 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:43,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:43,058 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:43,058 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:24:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:43,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:43,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:43,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:43,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:43,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:43,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 18 treesize of output 21 [2019-01-11 14:24:43,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,081 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-11 14:24:43,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:24:43,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:24:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:43,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,259 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:43,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:24:43,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:43,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:43,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:24:43,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:43,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:43,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,455 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:43,456 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-11 14:24:43,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:43,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:43,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,543 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:43,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:24:43,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,604 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-11 14:24:43,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:43,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,643 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,644 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-11 14:24:43,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,693 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-11 14:24:43,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:43,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:43,779 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-11 14:24:43,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:43,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 14:24:43,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:43,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:24:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:24:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:24:43,798 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-01-11 14:24:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:45,453 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-01-11 14:24:45,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:45,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-11 14:24:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:45,456 INFO L225 Difference]: With dead ends: 471 [2019-01-11 14:24:45,457 INFO L226 Difference]: Without dead ends: 470 [2019-01-11 14:24:45,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:24:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-11 14:24:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-01-11 14:24:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-11 14:24:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-01-11 14:24:46,094 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-01-11 14:24:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:46,094 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-01-11 14:24:46,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:24:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-01-11 14:24:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:46,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:46,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:46,095 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:46,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-01-11 14:24:46,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:46,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:46,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:46,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:46,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:46,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:46,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:46,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:46,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:46,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:46,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:46,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:46,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:46,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:24:46,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:46,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:46,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, 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-11 14:24:46,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,308 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-11 14:24:46,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:46,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:24:46,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,327 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-11 14:24:46,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,355 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,427 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:46,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,465 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-11 14:24:46,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:46,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:46,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,546 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-11 14:24:46,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:46,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:46,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:46,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,631 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-11 14:24:46,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,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-11 14:24:46,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:46,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:46,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:46,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:46,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:46,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,816 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:46,817 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-11 14:24:46,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:46,863 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-11 14:24:46,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:46,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:46,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:46,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 14:24:46,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:46,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:24:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:24:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:24:46,987 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-01-11 14:24:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:48,678 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-01-11 14:24:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:48,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-11 14:24:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:48,681 INFO L225 Difference]: With dead ends: 483 [2019-01-11 14:24:48,681 INFO L226 Difference]: Without dead ends: 482 [2019-01-11 14:24:48,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:24:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-11 14:24:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-01-11 14:24:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-11 14:24:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-01-11 14:24:49,371 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-01-11 14:24:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:49,371 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-01-11 14:24:49,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:24:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-01-11 14:24:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:49,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:49,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:49,372 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:49,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-01-11 14:24:49,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:49,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:49,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:49,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:49,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:49,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:24:49,506 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 14:24:49,507 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:49,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:49,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:49,509 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:49,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:49,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:49,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:49,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:49,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:49,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:49,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:49,556 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-11 14:24:49,563 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-11 14:24:49,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:24:49,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:24:49,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:49,775 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 14:24:49,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:24:49,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-01-11 14:24:49,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,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, 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 42 [2019-01-11 14:24:49,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:49,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-11 14:24:49,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,885 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:49,886 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-11 14:24:49,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:49,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:24:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:49,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:49,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:49,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:49,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:49,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:49,976 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-01-11 14:24:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:50,978 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-01-11 14:24:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:50,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:24:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:50,980 INFO L225 Difference]: With dead ends: 400 [2019-01-11 14:24:50,980 INFO L226 Difference]: Without dead ends: 393 [2019-01-11 14:24:50,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-11 14:24:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-01-11 14:24:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-11 14:24:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-01-11 14:24:51,665 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-01-11 14:24:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:51,665 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-01-11 14:24:51,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-01-11 14:24:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:51,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:51,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:51,666 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-01-11 14:24:51,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:51,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:51,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:51,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:51,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:51,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:51,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:51,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:24:51,786 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-11 14:24:51,786 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:51,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:51,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:51,789 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:51,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:51,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:51,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:51,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:51,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:51,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:51,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,813 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-11 14:24:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:24:51,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,829 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-11 14:24:51,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,837 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-11 14:24:51,837 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:51,916 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:51,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:51,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:52,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,023 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-11 14:24:52,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:52,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:52,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:52,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,108 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:52,109 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-11 14:24:52,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:52,157 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-11 14:24:52,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:52,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:52,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:52,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:52,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:52,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:52,230 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-01-11 14:24:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:53,314 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-01-11 14:24:53,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:53,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:24:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:53,315 INFO L225 Difference]: With dead ends: 409 [2019-01-11 14:24:53,315 INFO L226 Difference]: Without dead ends: 397 [2019-01-11 14:24:53,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-11 14:24:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-01-11 14:24:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-11 14:24:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-01-11 14:24:54,011 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-01-11 14:24:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:54,011 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-01-11 14:24:54,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-01-11 14:24:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:54,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:54,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:54,012 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-01-11 14:24:54,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:54,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:54,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:54,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:54,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:54,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:54,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:54,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:54,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:54,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:24:54,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:24:54,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:24:54,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:54,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:54,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, 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-11 14:24:54,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,309 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-11 14:24:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:54,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,322 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-11 14:24:54,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,327 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-11 14:24:54,328 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,355 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,406 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:54,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,475 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-11 14:24:54,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:54,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:54,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:24:54,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:54,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:54,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,639 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:54,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,640 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-11 14:24:54,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,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-11 14:24:54,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:54,735 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-11 14:24:54,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:54,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:54,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,828 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:54,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 14:24:54,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,875 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-11 14:24:54,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:24:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:54,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:55,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:55,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 14:24:55,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:55,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:24:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:24:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:24:55,004 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-01-11 14:24:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:56,935 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-01-11 14:24:56,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:56,936 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 14:24:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:56,938 INFO L225 Difference]: With dead ends: 542 [2019-01-11 14:24:56,939 INFO L226 Difference]: Without dead ends: 536 [2019-01-11 14:24:56,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:24:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-11 14:24:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-01-11 14:24:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-11 14:24:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-01-11 14:24:57,838 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-01-11 14:24:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:57,838 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-01-11 14:24:57,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:24:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-01-11 14:24:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:24:57,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:57,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:57,839 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:57,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:57,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-01-11 14:24:57,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:57,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:57,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:57,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:57,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:57,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:24:57,942 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-11 14:24:57,943 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:57,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:57,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:57,945 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:24:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:57,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:57,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:57,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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:57,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:57,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:57,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:57,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:24:57,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,969 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-11 14:24:57,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:24:57,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,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, 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-11 14:24:57,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:57,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,043 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:58,070 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:24:58,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:58,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:58,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:58,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,184 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-11 14:24:58,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:58,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:58,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,269 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:58,270 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 104 [2019-01-11 14:24:58,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,317 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-11 14:24:58,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:24:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:58,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:58,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:58,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:24:58,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:58,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:24:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:24:58,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:58,390 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-01-11 14:24:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:59,668 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-01-11 14:24:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:59,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:24:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:59,671 INFO L225 Difference]: With dead ends: 469 [2019-01-11 14:24:59,671 INFO L226 Difference]: Without dead ends: 465 [2019-01-11 14:24:59,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-11 14:25:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-01-11 14:25:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-11 14:25:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-01-11 14:25:00,617 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-01-11 14:25:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:00,617 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-01-11 14:25:00,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:25:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-01-11 14:25:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:00,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:00,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:00,619 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-01-11 14:25:00,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:00,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:00,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:00,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:00,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:00,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:00,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:00,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:00,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:00,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:00,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:00,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:00,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:00,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:25:00,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,907 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-11 14:25:00,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:25:00,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,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, 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-11 14:25:00,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:00,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:00,924 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:00,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:00,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:00,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:00,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:01,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:01,003 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:01,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:01,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:01,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:01,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:01,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,120 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:01,121 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-11 14:25:01,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:01,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:01,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-01-11 14:25:01,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-11 14:25:01,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:01,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:01,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-11 14:25:01,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,286 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:01,287 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-11 14:25:01,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:01,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:01,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:25:01,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:01,378 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:01,379 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-11 14:25:01,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:01,425 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-11 14:25:01,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:25:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:01,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:01,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:01,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 14:25:01,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:01,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:25:01,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:25:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:25:01,570 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-01-11 14:25:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:03,292 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-01-11 14:25:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:25:03,292 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 14:25:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:03,295 INFO L225 Difference]: With dead ends: 481 [2019-01-11 14:25:03,295 INFO L226 Difference]: Without dead ends: 480 [2019-01-11 14:25:03,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:25:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-11 14:25:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-01-11 14:25:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-11 14:25:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-01-11 14:25:03,809 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-01-11 14:25:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:03,809 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-01-11 14:25:03,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:25:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-01-11 14:25:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:03,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:03,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:03,810 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-01-11 14:25:03,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:03,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:03,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:03,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:03,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:03,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:03,894 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 14:25:03,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:03,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:03,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:03,897 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:25:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:03,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:03,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:03,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:03,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:03,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:03,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:03,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:03,922 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-11 14:25:03,927 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-11 14:25:03,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 14:25:03,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 14:25:03,949 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:04,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:04,004 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 14:25:04,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:25:04,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:04,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:04,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:25:04,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:04,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:25:04,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:04,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-11 14:25:04,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:25:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:04,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:04,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:04,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:25:04,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:04,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:25:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:25:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:25:04,140 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-01-11 14:25:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:04,816 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-01-11 14:25:04,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:25:04,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-11 14:25:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:04,818 INFO L225 Difference]: With dead ends: 267 [2019-01-11 14:25:04,818 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 14:25:04,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 14:25:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-11 14:25:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-11 14:25:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-01-11 14:25:05,340 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-01-11 14:25:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:05,340 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-01-11 14:25:05,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:25:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-01-11 14:25:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:05,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:05,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:05,341 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:05,341 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-01-11 14:25:05,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:05,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:05,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:05,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:05,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:05,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:05,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:05,545 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:05,546 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-01-11 14:25:05,546 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:05,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:05,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:05,548 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:05,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:05,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:05,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:05,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:05,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:05,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:05,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:05,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,568 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-11 14:25:05,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:25:05,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,578 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-11 14:25:05,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:05,585 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,612 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,674 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:05,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,714 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-11 14:25:05,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:05,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:05,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,800 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-11 14:25:05,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:05,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:05,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:05,884 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-11 14:25:05,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:05,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:25:05,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,969 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:05,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:05,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,016 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-11 14:25:06,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:25:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:06,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:06,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:06,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:25:06,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:06,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:25:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:25:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:06,116 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-01-11 14:25:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:07,332 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-01-11 14:25:07,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:07,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:25:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:07,337 INFO L225 Difference]: With dead ends: 309 [2019-01-11 14:25:07,337 INFO L226 Difference]: Without dead ends: 306 [2019-01-11 14:25:07,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:25:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-11 14:25:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-01-11 14:25:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-11 14:25:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-01-11 14:25:08,018 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-01-11 14:25:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:08,018 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-01-11 14:25:08,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:25:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-01-11 14:25:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:08,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:08,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:08,019 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-01-11 14:25:08,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:08,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:08,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:08,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:08,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:08,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:08,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:08,108 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:08,108 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 14:25:08,109 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:08,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:08,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:08,111 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:25:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:08,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:08,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:08,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:08,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:08,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:08,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:08,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:08,134 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-11 14:25:08,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:25:08,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:25:08,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-11 14:25:08,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,184 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:08,223 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-11 14:25:08,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:25:08,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 14:25:08,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:25:08,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:08,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 14:25:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:08,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:08,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:08,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 14:25:08,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:08,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:25:08,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:25:08,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:25:08,325 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-01-11 14:25:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:09,459 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-01-11 14:25:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:09,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:25:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:09,462 INFO L225 Difference]: With dead ends: 379 [2019-01-11 14:25:09,462 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 14:25:09,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:25:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 14:25:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-01-11 14:25:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-11 14:25:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-01-11 14:25:10,186 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-01-11 14:25:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:10,186 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-01-11 14:25:10,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:25:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-01-11 14:25:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:10,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:10,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:10,187 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-01-11 14:25:10,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:10,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:10,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:10,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:10,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:10,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:10,347 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-01-11 14:25:10,348 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:10,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:10,350 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:10,350 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:10,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:10,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:10,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:10,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:10,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:10,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:10,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:10,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, 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-11 14:25:10,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:25:10,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:25:10,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,409 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-11 14:25:10,410 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:10,531 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:25:10,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:10,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:10,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:10,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,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 31 treesize of output 57 [2019-01-11 14:25:10,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:10,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:10,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,695 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:10,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:25:10,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:10,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:25:10,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:10,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:25:10,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:10,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:25:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:10,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:10,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:10,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:25:10,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:10,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:10,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:10,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:10,869 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-01-11 14:25:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:12,556 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-01-11 14:25:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:25:12,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 14:25:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:12,558 INFO L225 Difference]: With dead ends: 371 [2019-01-11 14:25:12,559 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 14:25:12,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:25:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 14:25:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-01-11 14:25:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-11 14:25:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-01-11 14:25:13,445 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-01-11 14:25:13,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:13,445 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-01-11 14:25:13,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-01-11 14:25:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:13,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:13,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:13,446 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:13,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-01-11 14:25:13,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:13,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:13,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:13,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:13,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:13,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:13,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:13,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:13,573 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-01-11 14:25:13,574 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:13,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:13,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:13,575 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:13,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:13,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:13,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:13,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:13,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:13,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:13,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-11 14:25:13,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,601 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-11 14:25:13,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:25:13,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,617 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-11 14:25:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:13,627 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,675 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:13,703 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:13,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,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 36 treesize of output 72 [2019-01-11 14:25:13,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:13,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:13,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,833 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:13,834 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-11 14:25:13,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,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-11 14:25:13,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:13,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,918 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-11 14:25:13,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,962 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-11 14:25:13,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:13,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:14,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:25:14,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:14,049 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-11 14:25:14,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:25:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:14,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:14,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:14,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:25:14,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:14,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:25:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:25:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:14,136 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-01-11 14:25:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:15,623 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-01-11 14:25:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:15,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:25:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:15,625 INFO L225 Difference]: With dead ends: 285 [2019-01-11 14:25:15,625 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 14:25:15,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:25:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 14:25:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-01-11 14:25:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-11 14:25:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-01-11 14:25:16,539 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-01-11 14:25:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:16,539 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-01-11 14:25:16,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:25:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-01-11 14:25:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:16,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:16,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:16,540 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:16,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:16,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-01-11 14:25:16,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:16,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:16,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:16,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:16,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:16,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:16,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:16,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:16,660 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-11 14:25:16,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:16,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:16,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:16,663 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:25:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:16,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:16,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:16,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:16,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:16,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:16,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:16,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:25:16,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,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 23 treesize of output 37 [2019-01-11 14:25:16,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,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-11 14:25:16,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,709 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-11 14:25:16,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:16,796 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:16,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:16,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:16,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:16,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:16,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, 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-11 14:25:16,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:16,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:16,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,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 36 treesize of output 86 [2019-01-11 14:25:16,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:17,030 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-11 14:25:17,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:17,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:25:17,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:17,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:25:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:25:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:17,111 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-01-11 14:25:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:18,518 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-01-11 14:25:18,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:18,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:25:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:18,520 INFO L225 Difference]: With dead ends: 281 [2019-01-11 14:25:18,520 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 14:25:18,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 14:25:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-01-11 14:25:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-11 14:25:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-01-11 14:25:19,513 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-01-11 14:25:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:19,514 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-01-11 14:25:19,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:25:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-01-11 14:25:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:19,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:19,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:19,514 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:19,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:19,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-01-11 14:25:19,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:19,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:19,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:19,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:19,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:19,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:19,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:19,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:19,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:19,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:19,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:19,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:19,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:19,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:19,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:19,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:19,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-11 14:25:19,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:25:19,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,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, 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-11 14:25:19,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,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, 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-11 14:25:19,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:19,717 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:19,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:19,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:19,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:19,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:19,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:19,807 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:19,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,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, 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-11 14:25:19,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:19,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:19,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:19,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,919 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:19,920 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-11 14:25:19,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:19,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:19,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:19,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:19,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:20,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:20,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:20,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:20,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:20,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:20,087 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-11 14:25:20,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:20,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:20,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:20,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:20,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:20,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:20,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:20,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:20,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:20,242 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-01-11 14:25:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:21,913 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-01-11 14:25:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:21,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 14:25:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:21,915 INFO L225 Difference]: With dead ends: 295 [2019-01-11 14:25:21,915 INFO L226 Difference]: Without dead ends: 288 [2019-01-11 14:25:21,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:25:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-11 14:25:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-01-11 14:25:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-11 14:25:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-01-11 14:25:22,913 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-01-11 14:25:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:22,913 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-01-11 14:25:22,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-01-11 14:25:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:22,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:22,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:22,914 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-01-11 14:25:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:22,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:22,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:22,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:23,066 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 14:25:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:23,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:23,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:23,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:23,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:23,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:23,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:23,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:23,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:23,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:23,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:23,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:23,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:25:23,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:25:23,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:25:23,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,185 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:25:23,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:23,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:23,262 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:25:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:23,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:23,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:23,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:25:23,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:23,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:23,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,426 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:23,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:25:23,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:23,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:25:23,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:23,489 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:23,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:25:23,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:23,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:23,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:25:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:23,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:23,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:23,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:23,616 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-01-11 14:25:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:25,559 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-01-11 14:25:25,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:25,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 14:25:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:25,561 INFO L225 Difference]: With dead ends: 370 [2019-01-11 14:25:25,561 INFO L226 Difference]: Without dead ends: 363 [2019-01-11 14:25:25,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:25:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-11 14:25:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-01-11 14:25:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-11 14:25:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-01-11 14:25:26,703 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-01-11 14:25:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:26,703 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-01-11 14:25:26,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-01-11 14:25:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:26,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:26,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:26,704 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:26,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-01-11 14:25:26,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:26,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:26,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:26,847 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-01-11 14:25:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:26,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:26,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:26,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:26,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:26,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:26,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:26,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:25:26,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:25:26,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:25:26,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:26,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:26,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:26,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:25:26,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:26,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:25:26,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:26,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:26,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:25:26,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:26,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:26,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:26,975 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-11 14:25:26,976 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:26,995 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:27,040 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:25:27,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:27,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:27,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:27,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,144 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:27,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:25:27,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:27,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:27,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:25:27,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:27,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,264 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:27,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:27,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:25:27,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:27,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:27,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:25:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:27,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:27,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:27,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:27,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:27,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:27,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:27,392 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-01-11 14:25:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:29,200 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-01-11 14:25:29,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:29,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 14:25:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:29,201 INFO L225 Difference]: With dead ends: 349 [2019-01-11 14:25:29,201 INFO L226 Difference]: Without dead ends: 344 [2019-01-11 14:25:29,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:25:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-11 14:25:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-01-11 14:25:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 14:25:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-01-11 14:25:30,215 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-01-11 14:25:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:30,215 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-01-11 14:25:30,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-01-11 14:25:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:30,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:30,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:30,216 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-01-11 14:25:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:30,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:30,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:30,426 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 14:25:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:30,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:30,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:30,478 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:30,478 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 14:25:30,479 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:30,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:30,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:30,480 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:25:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:30,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:30,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:30,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:30,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:30,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:30,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:25:30,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:25:30,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,603 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:25:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:30,612 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:30,676 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:25:30,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:30,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:30,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:30,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,770 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:30,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:25:30,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:30,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:25:30,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:30,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:30,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:30,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:30,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:25:30,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:30,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:25:30,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:25:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:30,929 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-01-11 14:25:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:32,345 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-01-11 14:25:32,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:32,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:25:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:32,346 INFO L225 Difference]: With dead ends: 257 [2019-01-11 14:25:32,346 INFO L226 Difference]: Without dead ends: 250 [2019-01-11 14:25:32,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-11 14:25:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-01-11 14:25:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-11 14:25:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-01-11 14:25:33,354 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-01-11 14:25:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:33,354 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-01-11 14:25:33,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:25:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-01-11 14:25:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:33,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:33,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:33,354 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-01-11 14:25:33,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:33,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:33,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:33,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:33,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:33,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:33,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:33,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:33,488 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-01-11 14:25:33,488 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:33,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:33,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:33,489 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:33,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:33,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:33,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:33,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:33,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:33,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:33,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,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, 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-11 14:25:33,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,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, 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-11 14:25:33,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:25:33,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:33,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,603 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:33,629 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:33,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,664 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-11 14:25:33,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:33,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:33,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,747 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-11 14:25:33,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:33,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:33,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,828 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:33,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,830 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-11 14:25:33,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,878 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-11 14:25:33,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:25:33,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:33,921 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:33,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, 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 106 [2019-01-11 14:25:33,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:33,969 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-11 14:25:33,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:25:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:33,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:34,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:34,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:25:34,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:34,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:25:34,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:25:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:34,067 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-01-11 14:25:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:35,946 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-01-11 14:25:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:35,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:25:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:35,948 INFO L225 Difference]: With dead ends: 316 [2019-01-11 14:25:35,948 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 14:25:35,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:25:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 14:25:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-01-11 14:25:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-11 14:25:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-01-11 14:25:37,030 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-01-11 14:25:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:37,030 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-01-11 14:25:37,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:25:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-01-11 14:25:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:37,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:37,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:37,031 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-01-11 14:25:37,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:37,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:37,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:37,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:37,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:37,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:37,152 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-11 14:25:37,153 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:37,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:37,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:37,155 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:25:37,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:37,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:37,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:37,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:37,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:37,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:37,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:37,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 18 treesize of output 21 [2019-01-11 14:25:37,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,261 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-11 14:25:37,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:25:37,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,270 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-11 14:25:37,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:37,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,303 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:37,355 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:37,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,389 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-11 14:25:37,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:37,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:37,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,662 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:37,662 INFO L303 Elim1Store]: Index analysis took 209 ms [2019-01-11 14:25:37,663 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-11 14:25:37,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:37,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:37,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:37,736 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:37,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 36 treesize of output 80 [2019-01-11 14:25:37,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:37,781 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-11 14:25:37,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:37,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:37,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:37,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:25:37,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:37,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:25:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:25:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:37,859 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-01-11 14:25:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:39,301 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-01-11 14:25:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:39,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:25:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:39,302 INFO L225 Difference]: With dead ends: 253 [2019-01-11 14:25:39,302 INFO L226 Difference]: Without dead ends: 246 [2019-01-11 14:25:39,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-11 14:25:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-01-11 14:25:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-11 14:25:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-01-11 14:25:40,389 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-01-11 14:25:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:40,389 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-01-11 14:25:40,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:25:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-01-11 14:25:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:40,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:40,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:40,390 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:40,390 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-01-11 14:25:40,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:40,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:40,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:25:40,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:40,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:40,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:40,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:40,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:40,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:40,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:40,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:40,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:40,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:40,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-11 14:25:40,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,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-11 14:25:40,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,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, 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-11 14:25:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:25:40,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:40,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:40,709 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:40,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:40,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:40,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:40,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,831 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-11 14:25:40,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:40,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:40,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,921 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:40,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, 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-11 14:25:40,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:40,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:40,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:25:40,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:40,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:41,013 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:41,014 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 99 [2019-01-11 14:25:41,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:41,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:41,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:25:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:41,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:41,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:41,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:41,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:41,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:41,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:41,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:41,174 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-01-11 14:25:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:43,330 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-01-11 14:25:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:43,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 14:25:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:43,331 INFO L225 Difference]: With dead ends: 332 [2019-01-11 14:25:43,331 INFO L226 Difference]: Without dead ends: 328 [2019-01-11 14:25:43,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:25:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-11 14:25:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-01-11 14:25:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-11 14:25:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-01-11 14:25:44,337 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-01-11 14:25:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:44,337 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-01-11 14:25:44,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-01-11 14:25:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:44,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:44,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:44,338 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-01-11 14:25:44,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:44,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:44,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:44,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:44,855 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-11 14:25:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:25:44,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:44,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:44,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:44,904 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-11 14:25:44,905 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:44,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:44,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:44,907 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:25:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:44,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:44,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:44,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:44,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:44,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:44,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:44,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,930 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-11 14:25:44,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:25:44,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:25:44,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:44,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:45,032 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:45,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,063 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-11 14:25:45,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:45,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:45,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:45,140 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-11 14:25:45,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:45,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:45,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,219 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-11 14:25:45,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,265 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-11 14:25:45,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:45,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:45,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:45,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:25:45,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:45,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:25:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:25:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:45,344 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-01-11 14:25:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:46,777 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-01-11 14:25:46,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:46,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:25:46,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:46,778 INFO L225 Difference]: With dead ends: 242 [2019-01-11 14:25:46,778 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 14:25:46,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 14:25:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-11 14:25:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 14:25:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-01-11 14:25:47,866 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-01-11 14:25:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:47,866 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-01-11 14:25:47,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:25:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-01-11 14:25:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:47,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:47,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:47,867 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-01-11 14:25:47,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:47,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:47,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:47,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:47,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:48,013 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 14:25:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:48,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:48,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:48,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:48,070 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 14:25:48,071 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:48,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:48,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:48,072 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:25:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:48,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:48,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:48,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:48,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:48,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:48,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:48,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:48,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:25:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:25:48,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,140 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:25:48,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,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, 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-11 14:25:48,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,169 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:48,214 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:25:48,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:48,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:48,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:48,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 14:25:48,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:48,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:25:48,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:48,479 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-11 14:25:48,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 35 treesize of output 61 [2019-01-11 14:25:48,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:48,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:48,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:25:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:48,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:48,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:48,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:25:48,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:48,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:25:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:25:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:48,587 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-01-11 14:25:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:50,112 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-01-11 14:25:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:50,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:25:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:50,113 INFO L225 Difference]: With dead ends: 254 [2019-01-11 14:25:50,113 INFO L226 Difference]: Without dead ends: 245 [2019-01-11 14:25:50,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-11 14:25:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-01-11 14:25:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 14:25:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-01-11 14:25:51,202 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-01-11 14:25:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:51,202 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-01-11 14:25:51,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:25:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-01-11 14:25:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:51,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:51,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:51,203 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-01-11 14:25:51,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:51,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:51,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:51,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:51,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:51,316 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-01-11 14:25:51,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:51,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:51,318 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:51,319 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:25:51,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:51,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:51,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:51,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:51,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:51,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:51,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:51,344 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-11 14:25:51,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:25:51,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:25:51,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,366 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-11 14:25:51,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,433 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:25:51,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:51,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:51,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,533 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:51,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 14:25:51,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:25:51,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 14:25:51,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:25:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:51,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:51,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:51,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:25:51,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:51,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:25:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:25:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:51,725 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-01-11 14:25:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:53,196 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-01-11 14:25:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:53,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:25:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:53,197 INFO L225 Difference]: With dead ends: 249 [2019-01-11 14:25:53,197 INFO L226 Difference]: Without dead ends: 248 [2019-01-11 14:25:53,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-11 14:25:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-01-11 14:25:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-11 14:25:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-01-11 14:25:54,326 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-01-11 14:25:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:54,326 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-01-11 14:25:54,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:25:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-01-11 14:25:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:54,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:54,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:54,327 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-01-11 14:25:54,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:54,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:54,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:54,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:54,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:54,398 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:54,398 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-01-11 14:25:54,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:54,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:54,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:54,400 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:25:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:54,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:54,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:54,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:54,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:54,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:54,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-11 14:25:54,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:25:54,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:25:54,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,436 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-11 14:25:54,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:54,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:54,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:54,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:54,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:54,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:54,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:54,532 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 14:25:54,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:54,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:54,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:54,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:54,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:54,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:54,680 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-11 14:25:54,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:25:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:54,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:54,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:54,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:25:54,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:54,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:25:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:25:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:25:54,817 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-01-11 14:25:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:56,152 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-01-11 14:25:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:25:56,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-11 14:25:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:56,154 INFO L225 Difference]: With dead ends: 239 [2019-01-11 14:25:56,154 INFO L226 Difference]: Without dead ends: 230 [2019-01-11 14:25:56,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:25:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-11 14:25:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-11 14:25:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 14:25:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-01-11 14:25:57,283 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-01-11 14:25:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:57,283 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-01-11 14:25:57,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:25:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-01-11 14:25:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:25:57,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:57,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:57,284 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-11 14:25:57,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:57,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:57,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:57,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:57,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:57,356 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:25:57,356 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-01-11 14:25:57,357 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:57,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:57,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:57,358 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:25:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:57,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:57,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:57,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:57,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:57,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:57,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:57,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:25:57,381 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-11 14:25:57,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:25:57,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:25:57,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:57,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:57,480 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:25:57,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:57,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:57,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:25:57,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:25:57,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:57,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:25:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:57,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:57,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:25:57,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:57,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:25:57,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:25:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:25:57,660 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-01-11 14:25:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:58,889 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-01-11 14:25:58,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:25:58,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-11 14:25:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:58,891 INFO L225 Difference]: With dead ends: 236 [2019-01-11 14:25:58,891 INFO L226 Difference]: Without dead ends: 227 [2019-01-11 14:25:58,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:25:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-11 14:25:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-11 14:25:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 14:25:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-01-11 14:25:59,997 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-01-11 14:25:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:59,997 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-01-11 14:25:59,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:25:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-01-11 14:25:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:25:59,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:59,998 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:59,998 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-01-11 14:25:59,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:59,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:59,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:59,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:00,485 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 14:26:00,736 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 9 [2019-01-11 14:26:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:26:00,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:00,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:00,744 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:00,744 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-01-11 14:26:00,745 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:00,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:00,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:00,747 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:26:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:00,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:00,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:00,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:00,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:00,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:00,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:00,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:00,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:26:00,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:26:00,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:26:00,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,787 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-11 14:26:00,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:00,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:00,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:00,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:00,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:00,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:00,852 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:26:00,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:26:00,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:00,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:00,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:26:00,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 57 [2019-01-11 14:26:00,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:00,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:00,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:26:00,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:00,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:26:00,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:01,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:26:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:01,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:01,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:01,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:26:01,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:01,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:26:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:26:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:01,099 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-01-11 14:26:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:02,363 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-01-11 14:26:02,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:26:02,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 14:26:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:02,365 INFO L225 Difference]: With dead ends: 236 [2019-01-11 14:26:02,365 INFO L226 Difference]: Without dead ends: 227 [2019-01-11 14:26:02,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:26:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-11 14:26:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-01-11 14:26:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-11 14:26:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-01-11 14:26:03,451 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-01-11 14:26:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:03,451 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-01-11 14:26:03,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:26:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-01-11 14:26:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:03,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:03,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:03,452 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-01-11 14:26:03,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:03,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:03,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:03,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:03,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:03,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:03,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:03,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:03,616 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 14:26:03,616 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:03,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:03,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:03,618 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:03,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:03,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:03,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:03,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:03,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:03,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:03,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:03,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:26:03,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:26:03,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,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-11 14:26:03,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:03,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:03,893 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:03,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,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 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:26:03,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:03,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:04,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,014 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-11 14:26:04,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:04,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:04,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:04,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,097 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:04,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:26:04,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:04,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-11 14:26:04,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:04,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:04,187 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:04,188 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-11 14:26:04,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:04,238 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-11 14:26:04,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:04,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:04,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:04,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:26:04,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:04,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:26:04,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:26:04,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:26:04,333 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-01-11 14:26:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:06,412 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-01-11 14:26:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:26:06,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 14:26:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:06,413 INFO L225 Difference]: With dead ends: 326 [2019-01-11 14:26:06,414 INFO L226 Difference]: Without dead ends: 316 [2019-01-11 14:26:06,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:26:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-01-11 14:26:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-01-11 14:26:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-11 14:26:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-01-11 14:26:07,570 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-01-11 14:26:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:07,571 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-01-11 14:26:07,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:26:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-01-11 14:26:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:07,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:07,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:07,571 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:07,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-01-11 14:26:07,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:07,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:07,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:07,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:07,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:07,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:07,685 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 14:26:07,685 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:07,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:07,687 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:07,687 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:26:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:07,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:07,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:07,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:07,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:07,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:07,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:07,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:07,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:26:07,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:26:07,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,731 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:26:07,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,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, 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-11 14:26:07,745 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,763 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:07,809 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:26:07,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:26:07,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:07,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:26:07,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,892 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:07,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:26:07,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:07,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:26:07,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:07,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:26:07,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:07,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:07,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:26:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:07,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:08,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:08,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:26:08,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:08,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:26:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:26:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:08,042 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-01-11 14:26:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:09,932 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-01-11 14:26:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:26:09,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 14:26:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:09,934 INFO L225 Difference]: With dead ends: 288 [2019-01-11 14:26:09,934 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 14:26:09,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 14:26:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-01-11 14:26:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-11 14:26:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-01-11 14:26:11,522 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-01-11 14:26:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:11,523 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-01-11 14:26:11,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:26:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-01-11 14:26:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:11,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:11,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:11,524 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-11 14:26:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:11,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:11,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:26:11,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:11,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:11,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:11,672 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 14:26:11,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:11,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:11,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:11,675 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:26:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:11,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:11,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:11,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:11,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:11,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:11,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:11,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:11,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, 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-11 14:26:11,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:26:11,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:26:11,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:11,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,789 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:26:11,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:26:11,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:26:11,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:26:11,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:26:11,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,943 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:11,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:11,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:26:12,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-11 14:26:12,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:12,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:12,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:26:12,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:12,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:26:12,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:26:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:12,055 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-01-11 14:26:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:14,005 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-01-11 14:26:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:26:14,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 14:26:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:14,007 INFO L225 Difference]: With dead ends: 277 [2019-01-11 14:26:14,007 INFO L226 Difference]: Without dead ends: 268 [2019-01-11 14:26:14,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-11 14:26:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-01-11 14:26:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-11 14:26:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-01-11 14:26:15,664 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-01-11 14:26:15,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:15,664 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-01-11 14:26:15,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:26:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-01-11 14:26:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:15,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:15,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:15,666 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:15,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-01-11 14:26:15,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:15,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:15,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:15,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:15,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:15,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:15,875 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-01-11 14:26:15,875 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:15,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:15,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:15,877 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:26:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:15,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:15,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:15,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:15,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:15,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:15,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:15,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:26:15,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:26:15,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,914 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-11 14:26:15,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:15,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:15,922 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:15,949 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:15,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:15,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:15,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:16,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:16,002 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:16,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,038 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-11 14:26:16,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:16,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:16,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:16,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,120 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:16,120 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-11 14:26:16,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:16,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:16,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:16,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,205 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-11 14:26:16,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:16,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:16,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:16,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,291 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:16,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,293 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-11 14:26:16,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:16,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-11 14:26:16,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:26:16,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:16,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:16,384 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-11 14:26:16,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:16,431 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-11 14:26:16,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:26:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:16,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:16,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:16,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 14:26:16,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:16,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:26:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:26:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:26:16,548 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-01-11 14:26:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:19,487 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-01-11 14:26:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:26:19,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 14:26:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:19,494 INFO L225 Difference]: With dead ends: 361 [2019-01-11 14:26:19,494 INFO L226 Difference]: Without dead ends: 356 [2019-01-11 14:26:19,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:26:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-11 14:26:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-01-11 14:26:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-11 14:26:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-01-11 14:26:21,221 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-01-11 14:26:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:21,222 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-01-11 14:26:21,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:26:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-01-11 14:26:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:21,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:21,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:21,223 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:21,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-01-11 14:26:21,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:21,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:21,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:21,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:26:21,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:21,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:21,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:26:21,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:26:21,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:21,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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:21,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:26:21,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:26:21,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:26:21,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:26:21,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:21,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:21,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,454 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-11 14:26:21,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,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 23 treesize of output 37 [2019-01-11 14:26:21,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:26:21,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:21,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:21,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:21,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:21,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:21,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:21,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:21,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:21,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:21,586 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-11 14:26:21,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:22,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:22,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:22,396 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-11 14:26:22,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:22,696 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:22,696 INFO L303 Elim1Store]: Index analysis took 296 ms [2019-01-11 14:26:22,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:26:22,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:23,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:23,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,116 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-11 14:26:23,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:23,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:23,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,200 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:23,200 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-11 14:26:23,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:23,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:23,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,291 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:23,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,293 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-11 14:26:23,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,399 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-11 14:26:23,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:26:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:23,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:23,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:23,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 14:26:23,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:23,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:26:23,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:26:23,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:26:23,516 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-01-11 14:26:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:26,300 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-01-11 14:26:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:26:26,301 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 14:26:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:26,302 INFO L225 Difference]: With dead ends: 357 [2019-01-11 14:26:26,302 INFO L226 Difference]: Without dead ends: 352 [2019-01-11 14:26:26,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:26:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-11 14:26:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-01-11 14:26:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 14:26:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-01-11 14:26:27,808 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-01-11 14:26:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:27,808 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-01-11 14:26:27,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:26:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-01-11 14:26:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:27,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:27,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:27,809 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:27,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-01-11 14:26:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:27,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:27,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:26:27,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:27,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:28,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:28,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:28,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:26:28,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:26:28,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:28,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:28,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:26:28,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:26:28,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:26:28,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:26:28,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:28,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:28,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:26:28,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:26:28,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:26:28,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,110 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-11 14:26:28,111 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,190 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:28,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,225 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-11 14:26:28,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:28,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:28,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,304 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:28,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:26:28,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:28,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:28,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,389 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-11 14:26:28,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:28,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:28,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,479 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:28,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:26:28,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:28,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:28,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:28,573 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:28,574 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 99 [2019-01-11 14:26:28,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:28,619 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-11 14:26:28,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:28,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:28,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:28,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 14:26:28,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:28,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:26:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:26:28,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:26:28,744 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-01-11 14:26:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:30,982 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-01-11 14:26:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:26:30,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-01-11 14:26:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:30,984 INFO L225 Difference]: With dead ends: 260 [2019-01-11 14:26:30,984 INFO L226 Difference]: Without dead ends: 253 [2019-01-11 14:26:30,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:26:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-11 14:26:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-01-11 14:26:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-11 14:26:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-01-11 14:26:32,049 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-01-11 14:26:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:32,050 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-01-11 14:26:32,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:26:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-01-11 14:26:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:32,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:32,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:32,050 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:32,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-01-11 14:26:32,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:32,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:26:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:32,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:32,208 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 14:26:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:32,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:32,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:32,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:32,293 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 14:26:32,294 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:32,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:32,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:32,295 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:32,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:32,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:32,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:32,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:32,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:32,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:32,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:32,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 21 treesize of output 23 [2019-01-11 14:26:32,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:26:32,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,336 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:26:32,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,347 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-11 14:26:32,347 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,367 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:32,410 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:26:32,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:26:32,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:32,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:26:32,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:26:32,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:32,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:26:32,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,583 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:32,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:26:32,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:32,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:26:32,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:32,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:32,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:26:32,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:32,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:32,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:26:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:32,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:32,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:32,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:26:32,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:32,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:26:32,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:26:32,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:26:32,780 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-01-11 14:26:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:34,602 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-01-11 14:26:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:26:34,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:26:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:34,603 INFO L225 Difference]: With dead ends: 202 [2019-01-11 14:26:34,603 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 14:26:34,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:26:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 14:26:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-01-11 14:26:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-11 14:26:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-01-11 14:26:35,837 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-01-11 14:26:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:35,837 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-01-11 14:26:35,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:26:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-01-11 14:26:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:35,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:35,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:35,838 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:35,838 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-01-11 14:26:35,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:35,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:35,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:35,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:35,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:36,015 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-01-11 14:26:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:26:36,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:36,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:36,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:36,106 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 14:26:36,107 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:36,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:36,109 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:36,109 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:36,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:36,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:36,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:36,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:36,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:36,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:36,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:36,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,134 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-11 14:26:36,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:26:36,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,259 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-11 14:26:36,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:36,265 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,344 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:36,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,380 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-11 14:26:36,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:36,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:36,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,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, 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-11 14:26:36,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:36,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:36,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,557 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:36,558 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-11 14:26:36,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:36,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:36,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:36,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:36,647 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-11 14:26:36,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:36,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-11 14:26:36,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:36,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:36,772 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-11 14:26:36,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:36,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:26:36,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:36,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:26:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:26:36,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:36,792 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-01-11 14:26:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:38,659 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-01-11 14:26:38,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:26:38,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 14:26:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:38,660 INFO L225 Difference]: With dead ends: 199 [2019-01-11 14:26:38,661 INFO L226 Difference]: Without dead ends: 192 [2019-01-11 14:26:38,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:26:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-11 14:26:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-01-11 14:26:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-11 14:26:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-01-11 14:26:39,845 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-01-11 14:26:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:39,845 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-01-11 14:26:39,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:26:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-01-11 14:26:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:39,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:39,845 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:39,846 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-11 14:26:39,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:39,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:39,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:39,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:39,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:39,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:39,910 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-11 14:26:39,911 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:39,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:39,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:39,913 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:26:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:39,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:39,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:39,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:39,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:39,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:39,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:26:39,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:26:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:39,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:26:39,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:39,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:39,949 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:26:39,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:39,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:39,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:39,959 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-11 14:26:39,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:39,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:39,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:39,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:40,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:40,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:40,025 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 14:26:40,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:26:40,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:40,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:40,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:26:40,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:26:40,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:40,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:40,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:26:40,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:40,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:26:40,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:40,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:40,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:26:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:40,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:40,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:40,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:26:40,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:40,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:26:40,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:26:40,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:40,285 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-01-11 14:26:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:41,876 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-01-11 14:26:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:26:41,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 14:26:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:41,877 INFO L225 Difference]: With dead ends: 196 [2019-01-11 14:26:41,877 INFO L226 Difference]: Without dead ends: 187 [2019-01-11 14:26:41,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:26:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-11 14:26:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-11 14:26:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 14:26:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-01-11 14:26:43,295 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-01-11 14:26:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:43,295 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-01-11 14:26:43,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:26:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-01-11 14:26:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:43,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:43,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:43,296 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:43,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:43,296 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-11 14:26:43,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:43,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:43,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:43,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:43,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:26:43,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:43,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:43,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:43,399 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-11 14:26:43,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:43,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:43,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:43,401 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:26:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:43,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:43,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:43,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:43,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:43,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:43,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:43,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,422 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-11 14:26:43,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:26:43,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:26:43,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,440 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-11 14:26:43,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:43,530 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:43,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:26:43,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:43,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,644 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-11 14:26:43,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:43,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:43,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:43,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:43,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:26:43,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:43,771 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-11 14:26:43,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:26:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:43,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:43,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:43,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-11 14:26:43,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:43,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:26:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:26:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:26:43,860 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-01-11 14:26:44,435 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-11 14:26:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:46,082 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-01-11 14:26:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:26:46,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-11 14:26:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:46,083 INFO L225 Difference]: With dead ends: 203 [2019-01-11 14:26:46,084 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 14:26:46,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:26:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 14:26:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-01-11 14:26:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-11 14:26:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-01-11 14:26:47,568 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-01-11 14:26:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:47,568 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-01-11 14:26:47,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:26:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-01-11 14:26:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:47,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:47,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:47,569 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-01-11 14:26:47,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:47,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:47,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:47,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:47,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:47,711 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 14:26:47,712 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:47,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:47,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:47,713 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:47,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:47,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:47,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:47,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:47,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:47,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:26:47,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:26:47,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:26:47,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,749 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-11 14:26:47,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:47,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:47,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:47,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:47,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:47,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:47,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:47,837 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:47,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,875 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-11 14:26:47,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:47,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:47,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:47,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:47,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:26:47,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:48,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:48,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:48,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,043 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:48,044 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 99 [2019-01-11 14:26:48,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:48,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:48,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:48,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:48,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:48,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 14:26:48,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:48,176 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-11 14:26:48,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:26:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:48,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:48,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:48,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:26:48,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:48,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:26:48,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:26:48,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:48,265 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-01-11 14:26:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:50,793 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-01-11 14:26:50,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:26:50,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 14:26:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:50,795 INFO L225 Difference]: With dead ends: 269 [2019-01-11 14:26:50,795 INFO L226 Difference]: Without dead ends: 265 [2019-01-11 14:26:50,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:26:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-11 14:26:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-01-11 14:26:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 14:26:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-01-11 14:26:52,593 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-01-11 14:26:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:52,593 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-01-11 14:26:52,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:26:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-01-11 14:26:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:52,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:52,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:52,594 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-01-11 14:26:52,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:52,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:52,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:52,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:52,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:52,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:52,739 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-01-11 14:26:52,740 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:52,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:52,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:52,743 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:52,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:52,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:52,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:52,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:52,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:52,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:52,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 18 treesize of output 21 [2019-01-11 14:26:52,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:26:52,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:26:52,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,773 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-11 14:26:52,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,781 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-11 14:26:52,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:52,808 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:52,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:52,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:52,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:52,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:52,861 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:52,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:26:52,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:52,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:52,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:52,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:52,981 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-11 14:26:52,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:53,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:53,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:53,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:53,066 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 99 [2019-01-11 14:26:53,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:53,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:53,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:53,156 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:53,156 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 106 [2019-01-11 14:26:53,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:53,214 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-11 14:26:53,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:26:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:53,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:53,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:53,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:26:53,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:53,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:26:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:26:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:53,305 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-01-11 14:26:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:55,847 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-01-11 14:26:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:26:55,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 14:26:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:55,851 INFO L225 Difference]: With dead ends: 253 [2019-01-11 14:26:55,851 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 14:26:55,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:26:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 14:26:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-01-11 14:26:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-11 14:26:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-01-11 14:26:57,657 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-01-11 14:26:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:57,657 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-01-11 14:26:57,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:26:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-01-11 14:26:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:26:57,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:57,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:57,658 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-01-11 14:26:57,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:57,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:26:57,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:57,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:57,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:26:57,751 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-01-11 14:26:57,751 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:57,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:57,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:57,753 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:26:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:57,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:57,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:57,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:57,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:57,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:57,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:57,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:26:57,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:26:57,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:26:57,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:26:57,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:26:57,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:57,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:57,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:57,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:57,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:57,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:57,881 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:26:57,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,911 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-11 14:26:57,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:57,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:57,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:57,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:57,988 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-11 14:26:57,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:58,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:58,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:26:58,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:58,073 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:58,073 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-11 14:26:58,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:58,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-11 14:26:58,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 14:26:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:58,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:58,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:58,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-11 14:26:58,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:58,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:26:58,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:26:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:26:58,205 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-01-11 14:27:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:00,329 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-01-11 14:27:00,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:27:00,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-11 14:27:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:00,330 INFO L225 Difference]: With dead ends: 226 [2019-01-11 14:27:00,331 INFO L226 Difference]: Without dead ends: 217 [2019-01-11 14:27:00,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:27:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-11 14:27:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-01-11 14:27:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-11 14:27:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-01-11 14:27:02,173 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-01-11 14:27:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:02,173 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-01-11 14:27:02,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:27:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-01-11 14:27:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:27:02,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:02,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:02,174 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-01-11 14:27:02,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:02,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:02,438 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 14:27:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:27:02,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:02,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:02,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:27:02,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:27:02,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:02,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:02,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:27:02,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:27:02,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:27:02,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:27:02,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:02,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, 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-11 14:27:02,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,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, 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-11 14:27:02,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:27:02,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,585 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-11 14:27:02,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,591 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-11 14:27:02,592 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:02,671 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:27:02,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,708 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-11 14:27:02,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:02,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:02,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,787 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:02,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 38 treesize of output 79 [2019-01-11 14:27:02,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:02,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:27:02,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,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, 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-11 14:27:02,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:02,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:02,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:02,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:02,958 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:02,959 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-11 14:27:02,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:03,006 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-11 14:27:03,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:03,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:03,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:03,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:27:03,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:03,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:27:03,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:27:03,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:27:03,117 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-01-11 14:27:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:05,735 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-01-11 14:27:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:27:05,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:27:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:05,736 INFO L225 Difference]: With dead ends: 258 [2019-01-11 14:27:05,736 INFO L226 Difference]: Without dead ends: 251 [2019-01-11 14:27:05,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:27:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-11 14:27:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-01-11 14:27:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 14:27:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-01-11 14:27:07,555 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-01-11 14:27:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:07,555 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-01-11 14:27:07,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:27:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-01-11 14:27:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:27:07,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:07,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:07,556 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-01-11 14:27:07,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:07,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:07,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:27:07,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:07,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:07,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:07,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:07,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:27:07,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:27:07,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:07,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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:07,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:27:07,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:27:07,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:27:07,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:27:07,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:07,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:27:07,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:27:07,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:27:07,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:27:07,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:27:07,780 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:07,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 14:27:07,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:27:07,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:07,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:27:07,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,949 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:07,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 14:27:07,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:07,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 14:27:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:27:08,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:08,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 14:27:08,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,075 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:08,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 35 treesize of output 75 [2019-01-11 14:27:08,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:08,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:27:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:08,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:08,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:08,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:27:08,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:08,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:27:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:27:08,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:27:08,202 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-01-11 14:27:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:11,043 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-01-11 14:27:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:27:11,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:27:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:11,045 INFO L225 Difference]: With dead ends: 279 [2019-01-11 14:27:11,045 INFO L226 Difference]: Without dead ends: 272 [2019-01-11 14:27:11,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:27:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-11 14:27:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-01-11 14:27:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-11 14:27:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-01-11 14:27:13,107 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-01-11 14:27:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:13,107 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-01-11 14:27:13,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:27:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-01-11 14:27:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:27:13,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:13,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:13,107 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-01-11 14:27:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:13,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:27:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:13,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:13,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:13,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:13,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:27:13,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:27:13,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:13,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:13,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:27:13,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:27:13,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:27:13,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:27:13,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:13,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:27:13,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,357 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-11 14:27:13,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:27:13,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,367 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-11 14:27:13,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,376 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-11 14:27:13,376 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:13,455 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 14:27:13,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,494 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-11 14:27:13,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:13,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:13,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,572 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:13,572 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-11 14:27:13,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:13,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:27:13,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 90 [2019-01-11 14:27:13,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:13,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:13,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:13,742 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:13,743 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 106 [2019-01-11 14:27:13,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:13,794 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-11 14:27:13,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:13,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:13,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:13,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:27:13,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:13,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:27:13,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:27:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:27:13,904 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-01-11 14:27:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:16,638 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-01-11 14:27:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:27:16,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:27:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:16,640 INFO L225 Difference]: With dead ends: 256 [2019-01-11 14:27:16,640 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 14:27:16,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:27:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 14:27:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-01-11 14:27:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 14:27:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-01-11 14:27:18,684 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-01-11 14:27:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:18,684 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-01-11 14:27:18,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:27:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-01-11 14:27:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:27:18,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:18,685 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:18,685 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-01-11 14:27:18,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:18,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:27:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:18,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:27:18,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:18,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:18,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:27:18,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:27:18,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:18,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:18,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:27:18,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:27:18,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:27:18,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:27:18,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:18,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:27:18,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:27:18,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:27:18,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,844 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 14:27:18,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,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, 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-11 14:27:18,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:18,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:18,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:18,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:18,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:18,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:18,917 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 14:27:18,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:27:18,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:18,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-11 14:27:18,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:27:18,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:18,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:27:19,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:19,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-11 14:27:19,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:27:19,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,063 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:19,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,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 33 treesize of output 72 [2019-01-11 14:27:19,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:19,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:19,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:27:19,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:19,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, 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 89 [2019-01-11 14:27:19,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:19,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:19,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-01-11 14:27:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:19,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:19,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:19,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:27:19,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:19,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:27:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:27:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:27:19,253 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-01-11 14:27:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:21,669 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-01-11 14:27:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:27:21,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-11 14:27:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:21,670 INFO L225 Difference]: With dead ends: 234 [2019-01-11 14:27:21,671 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 14:27:21,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:27:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 14:27:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-01-11 14:27:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:27:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-01-11 14:27:22,139 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-01-11 14:27:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:22,139 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-01-11 14:27:22,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:27:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-01-11 14:27:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:27:22,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:22,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:22,140 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-01-11 14:27:22,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:22,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:22,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:27:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:22,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:22,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:22,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:22,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 14:27:22,377 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 14:27:22,378 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:27:22,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:27:22,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:27:22,379 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:27:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:22,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:27:22,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:22,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:22,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:22,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:22,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:22,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:27:22,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:27:22,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:27:22,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,412 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-11 14:27:22,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,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, 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-11 14:27:22,419 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,497 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:27:22,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,537 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-11 14:27:22,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:22,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:22,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,616 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:22,617 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-11 14:27:22,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:22,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:22,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,702 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-11 14:27:22,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:22,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:22,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,789 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:22,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 14:27:22,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:22,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 14:27:22,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,886 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:22,887 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-11 14:27:22,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,932 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-11 14:27:22,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:22,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:23,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:23,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 14:27:23,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:23,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:27:23,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:27:23,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:27:23,075 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-01-11 14:27:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:24,409 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-01-11 14:27:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:27:24,410 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-11 14:27:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:24,410 INFO L225 Difference]: With dead ends: 76 [2019-01-11 14:27:24,411 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 14:27:24,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-11 14:27:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 14:27:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-01-11 14:27:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 14:27:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-01-11 14:27:24,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-01-11 14:27:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:24,934 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-01-11 14:27:24,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:27:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-01-11 14:27:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:27:24,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:24,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:24,934 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-01-11 14:27:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:24,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:24,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:25,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:25,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:25,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:27:25,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:27:25,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:25,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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:27:25,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:27:25,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:27:25,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:27:25,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:25,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:27:25,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:27:25,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:27:25,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,186 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-11 14:27:25,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,194 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-11 14:27:25,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,272 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:27:25,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,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 36 treesize of output 72 [2019-01-11 14:27:25,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:25,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:25,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,390 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-11 14:27:25,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:25,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:25,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,474 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:25,475 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 99 [2019-01-11 14:27:25,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:25,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:27:25,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,561 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:25,562 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-11 14:27:25,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:25,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:25,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,649 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:25,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 40 treesize of output 96 [2019-01-11 14:27:25,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,695 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-11 14:27:25,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:25,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:25,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:25,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 14:27:25,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:25,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:27:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:27:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:27:25,821 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-01-11 14:27:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:27,115 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-01-11 14:27:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:27:27,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 14:27:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:27,116 INFO L225 Difference]: With dead ends: 75 [2019-01-11 14:27:27,116 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 14:27:27,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:27:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 14:27:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-01-11 14:27:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 14:27:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-01-11 14:27:27,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-01-11 14:27:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:27,594 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-01-11 14:27:27,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:27:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-01-11 14:27:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:27:27,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:27,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:27,595 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-01-11 14:27:27,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:27,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:27,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:27:27,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:27,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:27,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:27,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:27,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:27:27,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:27:27,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:27,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:27:27,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:27:27,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:27:27,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:27:27,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:27,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:27:27,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,870 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-11 14:27:27,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 14:27:27,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:27:27,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,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, 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-11 14:27:27,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:27,915 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:27,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:27,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:27,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:27,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:27,968 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:27:27,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:27,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,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, 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-11 14:27:28,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:28,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:28,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:28,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,090 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-11 14:27:28,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:28,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:28,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:28,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,178 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:28,179 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 99 [2019-01-11 14:27:28,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:28,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:28,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 14:27:28,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,270 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:28,270 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-11 14:27:28,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:28,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-11 14:27:28,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:28,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:28,358 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:28,359 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-11 14:27:28,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:28,404 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-11 14:27:28,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:28,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:28,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:28,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 14:27:28,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:28,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:27:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:27:28,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:27:28,527 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-01-11 14:27:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:30,307 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-01-11 14:27:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:27:30,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-11 14:27:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:30,308 INFO L225 Difference]: With dead ends: 97 [2019-01-11 14:27:30,308 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 14:27:30,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:27:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 14:27:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-01-11 14:27:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 14:27:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-01-11 14:27:31,088 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-01-11 14:27:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:31,088 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-01-11 14:27:31,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:27:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-01-11 14:27:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:27:31,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:31,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:31,089 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:31,089 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-01-11 14:27:31,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:31,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:31,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:27:31,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:31,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:31,261 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-01-11 14:27:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:31,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:31,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:31,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:27:31,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:27:31,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:31,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:31,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:31,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:31,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:31,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 14:27:31,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,440 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-11 14:27:31,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-11 14:27:31,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,450 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-11 14:27:31,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,457 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-11 14:27:31,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,537 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 14:27:31,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,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, 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-11 14:27:31,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:31,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:31,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,661 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:31,662 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-11 14:27:31,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:31,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-01-11 14:27:31,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,781 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 90 [2019-01-11 14:27:31,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:31,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:31,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,871 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:31,872 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-11 14:27:31,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:31,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:31,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:31,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:31,969 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:31,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:27:31,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:32,016 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-11 14:27:32,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:27:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:32,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:32,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:32,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 14:27:32,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:32,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:27:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:27:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:27:32,146 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-01-11 14:27:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:33,655 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-01-11 14:27:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:27:33,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 14:27:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:33,656 INFO L225 Difference]: With dead ends: 67 [2019-01-11 14:27:33,656 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:27:33,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:27:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:27:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:27:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:27:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:27:33,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-11 14:27:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:33,657 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:27:33,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:27:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:27:33,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:27:33,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:27:33,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:33,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:33,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:34,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:34,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:34,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:34,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:34,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:35,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:36,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:36,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:36,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:37,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:37,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:37,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:37,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:40,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:41,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:42,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:46,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:46,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:46,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:47,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:47,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:51,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:52,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:52,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:52,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:52,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:52,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:52,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:52,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:53,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:53,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:53,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:53,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:53,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:27:55,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:05,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:05,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:05,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:05,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:05,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:05,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:11,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:23,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:30,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:30,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:30,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:30,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:37,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:38,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:38,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:38,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:38,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:38,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:46,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:46,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:49,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:49,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:49,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:49,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:49,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:49,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:28:55,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:29:34,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:29:46,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:29:47,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:29:47,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:30:05,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:30:05,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:30:05,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:30:08,943 WARN L181 SmtUtils]: Spent 2.59 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-01-11 14:33:55,135 WARN L181 SmtUtils]: Spent 3.77 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-01-11 14:33:55,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:33:55,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-11 14:33:55,138 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-11 14:33:55,139 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-01-11 14:33:55,140 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-01-11 14:33:55,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-01-11 14:33:55,158 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:33:55 BoogieIcfgContainer [2019-01-11 14:33:55,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:33:55,159 INFO L168 Benchmark]: Toolchain (without parser) took 683642.58 ms. Allocated memory was 141.6 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 109.0 MB in the beginning and 729.8 MB in the end (delta: -620.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2019-01-11 14:33:55,160 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:33:55,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.40 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 106.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:33:55,160 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:33:55,161 INFO L168 Benchmark]: RCFGBuilder took 526.05 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 94.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:33:55,161 INFO L168 Benchmark]: TraceAbstraction took 683030.02 ms. Allocated memory was 141.6 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.7 MB in the beginning and 729.8 MB in the end (delta: -636.1 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2019-01-11 14:33:55,162 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.40 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 106.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.05 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 94.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 683030.02 ms. Allocated memory was 141.6 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.7 MB in the beginning and 729.8 MB in the end (delta: -636.1 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 682.9s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 138.6s AutomataDifference, 0.0s DeadEndRemovalTime, 381.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 58.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 60.3s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 155.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 226.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 95.3s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...