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-8-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:23:13,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:23:13,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:23:13,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:23:13,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:23:13,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:23:13,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:23:13,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:23:13,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:23:13,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:23:13,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:23:13,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:23:13,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:23:13,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:23:13,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:23:13,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:23:13,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:23:13,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:23:13,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:23:13,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:23:13,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:23:13,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:23:13,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:23:13,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:23:13,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:23:13,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:23:13,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:23:13,370 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:23:13,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:23:13,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:23:13,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:23:13,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:23:13,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:23:13,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:23:13,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:23:13,376 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:23:13,376 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-02-25 15:23:13,389 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:23:13,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:23:13,390 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:23:13,390 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:23:13,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:23:13,391 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:23:13,391 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:23:13,391 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:23:13,391 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:23:13,392 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:23:13,392 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:23:13,392 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:23:13,392 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:23:13,392 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:23:13,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:23:13,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:23:13,394 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:23:13,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:23:13,394 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:23:13,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:23:13,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:23:13,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:23:13,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:23:13,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:23:13,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:23:13,396 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:23:13,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:23:13,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:23:13,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:23:13,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:23:13,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:23:13,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:23:13,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:23:13,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:23:13,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:23:13,398 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:23:13,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:23:13,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:23:13,398 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:23:13,398 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:23:13,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:23:13,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:23:13,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:23:13,456 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:23:13,457 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:23:13,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl [2019-02-25 15:23:13,458 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl' [2019-02-25 15:23:13,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:23:13,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:23:13,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:23:13,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:23:13,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:23:13,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:23:13,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:23:13,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:23:13,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:23:13,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... [2019-02-25 15:23:13,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:23:13,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:23:13,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:23:13,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:23:13,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:23:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:23:13,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:23:14,111 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:23:14,112 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-02-25 15:23:14,112 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:23:14 BoogieIcfgContainer [2019-02-25 15:23:14,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:23:14,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:23:14,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:23:14,123 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:23:14,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:13" (1/2) ... [2019-02-25 15:23:14,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf95b7c and model type speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:23:14, skipping insertion in model container [2019-02-25 15:23:14,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:23:14" (2/2) ... [2019-02-25 15:23:14,128 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-unlimited.bpl [2019-02-25 15:23:14,138 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:23:14,147 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-02-25 15:23:14,165 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-02-25 15:23:14,204 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:23:14,204 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:23:14,205 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:23:14,205 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:23:14,205 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:23:14,205 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:23:14,205 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:23:14,206 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:23:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-02-25 15:23:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:23:14,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:14,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:23:14,239 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-02-25 15:23:14,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:14,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:14,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:14,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:14,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:23:14,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:14,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:23:14,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:23:14,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:14,490 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-02-25 15:23:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:14,737 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-02-25 15:23:14,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:14,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:23:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:14,754 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:23:14,754 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:23:14,757 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-02-25 15:23:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:23:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-02-25 15:23:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:23:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-02-25 15:23:14,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-02-25 15:23:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:14,796 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-02-25 15:23:14,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:23:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-02-25 15:23:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:14,797 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:14,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:14,798 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-02-25 15:23:14,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:14,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:14,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:14,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:14,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:14,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:14,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:14,970 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:14,975 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-02-25 15:23:15,019 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:15,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:15,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:15,093 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 2. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:15,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:15,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:15,099 INFO 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-02-25 15:23:15,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:15,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:15,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:23:15,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:15,202 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:15,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,222 INFO L467 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 30 treesize of output 36 [2019-02-25 15:23:15,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,237 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:23:15,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:23:15,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,334 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:23:15,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:23:15,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:23:15,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,608 INFO L292 Elim1Store]: Index analysis took 164 ms [2019-02-25 15:23:15,611 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:23:15,613 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,949 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,204 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,403 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,467 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,516 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,545 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,569 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,873 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:23:16,874 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,939 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,974 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,040 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,140 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,196 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,257 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,374 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,506 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:17,506 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:147, output treesize:153 [2019-02-25 15:23:17,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,583 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:23:17,584 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,820 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:17,820 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-25 15:23:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:17,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:17,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:17,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:17,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:17,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:17,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:17,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:17,892 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-02-25 15:23:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:29,085 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2019-02-25 15:23:29,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:29,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:29,088 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:23:29,088 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:23:29,090 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-02-25 15:23:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:23:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2019-02-25 15:23:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:23:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2019-02-25 15:23:29,099 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 3 [2019-02-25 15:23:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:29,100 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. [2019-02-25 15:23:29,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. [2019-02-25 15:23:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:29,100 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:29,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:29,101 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:29,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:29,101 INFO L82 PathProgramCache]: Analyzing trace with hash 30384, now seen corresponding path program 1 times [2019-02-25 15:23:29,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:29,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:29,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:29,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:29,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:29,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:29,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:29,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:29,194 INFO L207 CegarAbsIntRunner]: [0], [18], [35] [2019-02-25 15:23:29,195 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:29,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:29,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:29,204 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 2. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:29,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:29,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:29,205 INFO 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-02-25 15:23:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:29,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:29,222 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:23:29,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:29,241 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:29,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,250 INFO L467 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 30 treesize of output 36 [2019-02-25 15:23:29,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,261 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:23:29,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,273 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:23:29,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,297 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:23:29,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,392 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:23:29,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:29,411 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:23:29,519 INFO L292 Elim1Store]: Index analysis took 103 ms [2019-02-25 15:23:29,521 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:23:29,522 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,583 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,634 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,673 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,715 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,739 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,759 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,778 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,917 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:23:29,918 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,942 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,962 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:29,987 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:30,018 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:30,055 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:30,602 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:30,684 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:30,685 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:23:30,846 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-02-25 15:23:30,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:30,877 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:30,878 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:30,947 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:30,948 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:23:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:31,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:31,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:31,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:31,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:31,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:31,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:31,079 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 6 states. [2019-02-25 15:23:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:32,053 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2019-02-25 15:23:32,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:32,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:32,055 INFO L225 Difference]: With dead ends: 62 [2019-02-25 15:23:32,055 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:23:32,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:23:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:23:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 26. [2019-02-25 15:23:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:23:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2019-02-25 15:23:32,069 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 3 [2019-02-25 15:23:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:32,069 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. [2019-02-25 15:23:32,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. [2019-02-25 15:23:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:32,070 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:32,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:32,070 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash 30944, now seen corresponding path program 1 times [2019-02-25 15:23:32,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:32,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:32,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:32,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:23:32,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:32,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:23:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:23:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:32,146 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 3 states. [2019-02-25 15:23:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:32,216 INFO L93 Difference]: Finished difference Result 31 states and 61 transitions. [2019-02-25 15:23:32,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:32,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:23:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:32,218 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:23:32,218 INFO L226 Difference]: Without dead ends: 30 [2019-02-25 15:23:32,219 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-02-25 15:23:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-25 15:23:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-02-25 15:23:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:23:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2019-02-25 15:23:32,224 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 60 transitions. Word has length 3 [2019-02-25 15:23:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:32,225 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 60 transitions. [2019-02-25 15:23:32,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:23:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 60 transitions. [2019-02-25 15:23:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:32,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:32,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:32,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:32,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:32,226 INFO L82 PathProgramCache]: Analyzing trace with hash 30012, now seen corresponding path program 1 times [2019-02-25 15:23:32,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:32,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:32,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:32,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:32,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:32,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:32,312 INFO L207 CegarAbsIntRunner]: [0], [6], [35] [2019-02-25 15:23:32,314 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:32,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:32,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:32,322 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 2. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:32,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:32,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:32,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 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-02-25 15:23:32,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:32,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:32,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:23:32,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:32,490 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:23:32,491 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,527 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,537 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,550 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,571 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,602 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,650 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,707 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:32,711 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:23:32,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:23:32,720 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:23:32,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:23:32,757 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:23:32,761 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:23:32,805 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:23:32,807 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,879 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,923 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,957 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,982 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,002 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,021 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,039 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,115 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:33,116 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:121, output treesize:125 [2019-02-25 15:23:33,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,204 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:33,205 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,271 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:33,272 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:23:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:33,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:33,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:23:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:23:33,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:33,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:33,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:33,313 INFO L87 Difference]: Start difference. First operand 26 states and 60 transitions. Second operand 4 states. [2019-02-25 15:23:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:33,397 INFO L93 Difference]: Finished difference Result 32 states and 98 transitions. [2019-02-25 15:23:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:23:33,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:23:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:33,399 INFO L225 Difference]: With dead ends: 32 [2019-02-25 15:23:33,399 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:23:33,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:23:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-25 15:23:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:23:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-25 15:23:33,408 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 3 [2019-02-25 15:23:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:33,408 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-25 15:23:33,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-25 15:23:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:33,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:33,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:33,409 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:33,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash 30136, now seen corresponding path program 1 times [2019-02-25 15:23:33,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:33,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:33,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:33,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:33,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:33,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:33,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:33,494 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:33,494 INFO L207 CegarAbsIntRunner]: [0], [10], [35] [2019-02-25 15:23:33,496 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:33,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:33,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:33,504 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 2. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:33,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:33,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:33,505 INFO 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-02-25 15:23:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:33,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:33,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:23:33,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:33,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:33,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,546 INFO L467 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 30 treesize of output 36 [2019-02-25 15:23:33,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,568 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:23:33,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,634 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:23:33,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,647 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:23:33,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,663 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:23:33,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,682 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:23:33,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:23:33,703 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,092 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,138 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,178 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,211 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,239 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,263 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,284 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:23:34,425 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,790 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,806 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,831 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,871 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,918 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,970 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,043 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:35,043 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:23:35,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:35,131 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,197 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:35,198 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:23:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:35,217 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:35,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:35,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:35,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:35,247 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 6 states. [2019-02-25 15:23:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:36,209 INFO L93 Difference]: Finished difference Result 65 states and 143 transitions. [2019-02-25 15:23:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:36,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:36,210 INFO L225 Difference]: With dead ends: 65 [2019-02-25 15:23:36,210 INFO L226 Difference]: Without dead ends: 64 [2019-02-25 15:23:36,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:23:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-25 15:23:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-02-25 15:23:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:23:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 115 transitions. [2019-02-25 15:23:36,220 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 115 transitions. Word has length 3 [2019-02-25 15:23:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:36,220 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 115 transitions. [2019-02-25 15:23:36,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 115 transitions. [2019-02-25 15:23:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:36,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:36,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:36,221 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash 30632, now seen corresponding path program 1 times [2019-02-25 15:23:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:36,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:36,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:36,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:36,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:36,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:36,391 INFO L207 CegarAbsIntRunner]: [0], [26], [35] [2019-02-25 15:23:36,392 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:36,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:36,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:36,399 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 2. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:36,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:36,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:36,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:36,400 INFO 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-02-25 15:23:36,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:36,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:36,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:23:36,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:36,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:36,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,433 INFO L467 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 30 treesize of output 36 [2019-02-25 15:23:36,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:23:36,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:23:36,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,637 INFO L292 Elim1Store]: Index analysis took 108 ms [2019-02-25 15:23:36,638 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:23:36,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,652 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:23:36,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,672 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:23:36,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:23:36,716 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,789 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,837 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,876 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,905 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,931 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,950 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,969 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,220 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:23:37,221 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,631 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,753 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,774 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,797 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,832 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,878 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,997 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:37,998 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:23:38,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,046 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:38,046 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,110 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:38,111 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:23:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:38,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:38,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:38,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:38,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:38,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:38,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:38,176 INFO L87 Difference]: Start difference. First operand 32 states and 115 transitions. Second operand 6 states. [2019-02-25 15:23:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:38,905 INFO L93 Difference]: Finished difference Result 67 states and 161 transitions. [2019-02-25 15:23:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:38,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:38,906 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:23:38,906 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:23:38,907 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-02-25 15:23:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:23:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34. [2019-02-25 15:23:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:23:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 132 transitions. [2019-02-25 15:23:38,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 132 transitions. Word has length 3 [2019-02-25 15:23:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:38,915 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 132 transitions. [2019-02-25 15:23:38,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 132 transitions. [2019-02-25 15:23:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:38,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:38,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:38,916 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash 954866, now seen corresponding path program 1 times [2019-02-25 15:23:38,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:38,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:38,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:38,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:39,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:39,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:39,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:39,072 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [35] [2019-02-25 15:23:39,073 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:39,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:39,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:39,080 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:39,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:39,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:39,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 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-02-25 15:23:39,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:39,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:39,102 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:23:39,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:39,109 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:39,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,118 INFO L467 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 30 treesize of output 36 [2019-02-25 15:23:39,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,129 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:23:39,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,138 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:23:39,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,152 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:23:39,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,167 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:23:39,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:23:39,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,212 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:23:39,214 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,320 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,423 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,461 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,489 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,517 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,536 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,556 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,654 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:23:39,655 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,691 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,709 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,729 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,759 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,793 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,838 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,905 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:40,006 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:40,007 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:23:40,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,141 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:23:40,142 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:40,262 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:40,263 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:23:40,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:40,362 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:40,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:23:40,375 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:40,470 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:40,471 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:107 [2019-02-25 15:23:40,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-02-25 15:23:40,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:40,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:40,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:40,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:40,605 INFO L87 Difference]: Start difference. First operand 34 states and 132 transitions. Second operand 8 states. [2019-02-25 15:23:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:44,971 INFO L93 Difference]: Finished difference Result 82 states and 191 transitions. [2019-02-25 15:23:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:44,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:44,973 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:23:44,973 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:23:44,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:23:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 36. [2019-02-25 15:23:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:23:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 128 transitions. [2019-02-25 15:23:44,982 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 128 transitions. Word has length 4 [2019-02-25 15:23:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:44,983 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 128 transitions. [2019-02-25 15:23:44,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 128 transitions. [2019-02-25 15:23:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:44,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:44,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:44,984 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:44,984 INFO L82 PathProgramCache]: Analyzing trace with hash 955426, now seen corresponding path program 1 times [2019-02-25 15:23:44,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:44,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:44,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:44,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:45,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:45,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:45,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:45,076 INFO L207 CegarAbsIntRunner]: [0], [32], [36], [37] [2019-02-25 15:23:45,077 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:45,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:45,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:45,085 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:45,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:45,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:45,086 INFO 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-02-25 15:23:45,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:45,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:45,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:45,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:45,198 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:45,198 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,224 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,248 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,278 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,326 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,388 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,457 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:45,463 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-02-25 15:23:45,471 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-25 15:23:45,474 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:23:45,481 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:23:45,487 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:23:45,492 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:23:45,506 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:23:45,507 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,569 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,606 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,663 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,684 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,703 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,718 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,734 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:45,821 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:45,822 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:23:46,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,522 INFO L292 Elim1Store]: Index analysis took 128 ms [2019-02-25 15:23:46,578 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 51 treesize of output 149 [2019-02-25 15:23:46,578 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-02-25 15:23:46,630 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-02-25 15:23:48,339 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 54 dim-0 vars, and 9 xjuncts. [2019-02-25 15:23:48,340 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:131, output treesize:1017 [2019-02-25 15:23:58,034 WARN L181 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 548 DAG size of output: 117 [2019-02-25 15:23:58,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-02-25 15:23:58,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:58,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:23:58,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:23:58,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:58,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-02-25 15:23:58,132 INFO L87 Difference]: Start difference. First operand 36 states and 128 transitions. Second operand 4 states. [2019-02-25 15:23:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:58,363 INFO L93 Difference]: Finished difference Result 40 states and 140 transitions. [2019-02-25 15:23:58,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:58,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:23:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:58,364 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:23:58,364 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:23:58,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-02-25 15:23:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:23:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-25 15:23:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:23:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 138 transitions. [2019-02-25 15:23:58,377 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 138 transitions. Word has length 4 [2019-02-25 15:23:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:58,377 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 138 transitions. [2019-02-25 15:23:58,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 138 transitions. [2019-02-25 15:23:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:58,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:58,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:58,379 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:58,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:58,379 INFO L82 PathProgramCache]: Analyzing trace with hash 954990, now seen corresponding path program 1 times [2019-02-25 15:23:58,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:58,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:58,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:58,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:58,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:58,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:58,454 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [35] [2019-02-25 15:23:58,455 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:58,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:58,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:58,460 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:58,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:58,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:58,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:23:58,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:58,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:58,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:23:58,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:58,590 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:23:58,591 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:58,639 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:58,671 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:58,708 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:58,750 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:58,803 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:58,863 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:58,937 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:23:59,023 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:23:59,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:23:59,030 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:23:59,035 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:23:59,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:23:59,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:23:59,048 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:23:59,048 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,117 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,158 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,188 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,213 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,233 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,249 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,267 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,363 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:59,364 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:23:59,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,438 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:23:59,439 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,545 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:59,546 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:23:59,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,606 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:59,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:23:59,612 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:59,719 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:59,719 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-02-25 15:23:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:59,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:59,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:59,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:59,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:59,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:59,858 INFO L87 Difference]: Start difference. First operand 38 states and 138 transitions. Second operand 8 states. [2019-02-25 15:24:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:03,687 INFO L93 Difference]: Finished difference Result 84 states and 220 transitions. [2019-02-25 15:24:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:03,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:03,690 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:24:03,690 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:24:03,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-02-25 15:24:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:24:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2019-02-25 15:24:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:24:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-02-25 15:24:03,702 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-02-25 15:24:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:03,702 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-02-25 15:24:03,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-02-25 15:24:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:03,703 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:03,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:03,704 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 954618, now seen corresponding path program 1 times [2019-02-25 15:24:03,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:03,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:03,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:03,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:03,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:03,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:03,786 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [35] [2019-02-25 15:24:03,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:03,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:03,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:03,792 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:03,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:03,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:03,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:24:03,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:03,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:03,809 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:24:03,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:03,867 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:24:03,868 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,901 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,912 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,937 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,974 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,014 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,070 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,133 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,207 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:04,246 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:24:04,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:04,276 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:24:04,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:04,313 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:04,333 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:04,346 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:24:04,347 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,435 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,473 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,507 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,536 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,559 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,578 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,596 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,698 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:04,698 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:24:04,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,736 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:24:04,737 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,911 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:04,911 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:24:04,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,948 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:04,950 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:24:04,951 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,067 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:05,068 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:107 [2019-02-25 15:24:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:05,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:05,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:05,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:05,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:05,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:05,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:05,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:05,134 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-02-25 15:24:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:08,730 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-02-25 15:24:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:08,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:08,732 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:24:08,732 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:24:08,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:24:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 43. [2019-02-25 15:24:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:24:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-02-25 15:24:08,743 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-02-25 15:24:08,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:08,743 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-02-25 15:24:08,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-02-25 15:24:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:08,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:08,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:08,745 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:08,745 INFO L82 PathProgramCache]: Analyzing trace with hash 955114, now seen corresponding path program 1 times [2019-02-25 15:24:08,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:08,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:08,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:08,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:08,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:08,811 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:08,811 INFO L207 CegarAbsIntRunner]: [0], [26], [32], [35] [2019-02-25 15:24:08,812 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:08,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:08,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:08,816 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:08,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:08,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:08,817 INFO 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-02-25 15:24:08,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:08,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:08,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:24:08,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:08,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:24:08,946 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,985 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,045 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,080 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,133 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,187 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,260 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,332 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,420 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:09,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:24:09,447 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:09,450 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:24:09,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:09,458 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:09,462 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:09,469 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:24:09,470 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,538 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,580 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,612 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,637 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,655 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,673 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,688 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,803 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:09,803 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:24:09,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,837 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:24:09,837 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,928 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:09,929 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:24:09,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,963 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:09,965 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:24:09,965 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,049 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:10,050 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:107 [2019-02-25 15:24:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:10,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:10,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-02-25 15:24:10,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:10,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:10,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:10,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:10,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:10,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:10,238 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-02-25 15:24:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:13,845 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-02-25 15:24:13,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:13,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:13,846 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:24:13,847 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:24:13,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:24:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 44. [2019-02-25 15:24:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-25 15:24:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 175 transitions. [2019-02-25 15:24:13,858 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 175 transitions. Word has length 4 [2019-02-25 15:24:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:13,859 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 175 transitions. [2019-02-25 15:24:13,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 175 transitions. [2019-02-25 15:24:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:13,859 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:13,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:13,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 954742, now seen corresponding path program 1 times [2019-02-25 15:24:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:13,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:13,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:14,319 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 12 [2019-02-25 15:24:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:14,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:14,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:14,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:14,347 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [35] [2019-02-25 15:24:14,348 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:14,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:14,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:14,353 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:14,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:14,354 INFO 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-02-25 15:24:14,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:14,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:14,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:24:14,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:14,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:14,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,379 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:14,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,386 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:14,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:14,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,408 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:14,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:14,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:14,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,605 INFO L292 Elim1Store]: Index analysis took 163 ms [2019-02-25 15:24:14,606 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:24:14,608 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,508 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,552 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,586 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,615 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,640 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,660 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,680 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:24:15,926 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,957 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,968 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,992 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,021 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,056 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,101 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,162 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,256 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:16,256 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:24:16,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:24:16,341 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,452 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:16,452 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:24:16,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:24:16,502 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,587 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:16,588 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-02-25 15:24:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:16,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:16,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:16,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:16,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:16,719 INFO L87 Difference]: Start difference. First operand 44 states and 175 transitions. Second operand 8 states. [2019-02-25 15:24:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:21,335 INFO L93 Difference]: Finished difference Result 99 states and 274 transitions. [2019-02-25 15:24:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:21,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:21,337 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:24:21,337 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:24:21,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:24:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2019-02-25 15:24:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:24:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 210 transitions. [2019-02-25 15:24:21,349 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 210 transitions. Word has length 4 [2019-02-25 15:24:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:21,350 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 210 transitions. [2019-02-25 15:24:21,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 210 transitions. [2019-02-25 15:24:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:21,351 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:21,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:21,351 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 941536, now seen corresponding path program 1 times [2019-02-25 15:24:21,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:21,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:21,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:21,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:21,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:21,506 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:24:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:21,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:21,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:21,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:21,518 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [35] [2019-02-25 15:24:21,519 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:21,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:21,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:21,526 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:21,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:21,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:21,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:24:21,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:21,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:21,542 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:21,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:21,548 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:21,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,555 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:21,564 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,566 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:21,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,577 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:21,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,587 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:21,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,612 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:21,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:21,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:21,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:21,642 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,699 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,743 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,779 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,807 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,829 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,848 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,866 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:21,942 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:21,990 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,001 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,023 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,047 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,082 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,124 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,192 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,193 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:22,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,243 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:22,244 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,312 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,312 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:22,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:22,356 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,415 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,416 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:24:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:22,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:22,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:22,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:22,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:22,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:22,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:22,475 INFO L87 Difference]: Start difference. First operand 52 states and 210 transitions. Second operand 8 states. [2019-02-25 15:24:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:22,991 INFO L93 Difference]: Finished difference Result 101 states and 289 transitions. [2019-02-25 15:24:22,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:22,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:22,993 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:24:22,993 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:24:22,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-02-25 15:24:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:24:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2019-02-25 15:24:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:24:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 243 transitions. [2019-02-25 15:24:23,008 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 243 transitions. Word has length 4 [2019-02-25 15:24:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:23,008 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 243 transitions. [2019-02-25 15:24:23,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 243 transitions. [2019-02-25 15:24:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:23,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:23,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:23,009 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash 941164, now seen corresponding path program 1 times [2019-02-25 15:24:23,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:23,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:23,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:23,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:23,152 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-02-25 15:24:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:23,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:23,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:23,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:23,165 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [35] [2019-02-25 15:24:23,166 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:23,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:23,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:23,170 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:23,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:23,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:23,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:23,171 INFO 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-02-25 15:24:23,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:23,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:23,186 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:23,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:23,737 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:23,738 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,139 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,268 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,506 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,824 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,215 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,739 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:26,337 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:24:26,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:26,365 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:24:26,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:26,397 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:26,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:26,584 INFO L292 Elim1Store]: Index analysis took 166 ms [2019-02-25 15:24:26,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:26,587 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,966 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,006 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,038 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,062 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,082 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,099 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,115 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,186 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:27,186 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:27,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,236 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:27,237 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,298 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:27,298 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:27,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,331 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:27,332 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:27,333 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,392 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:27,393 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:82 [2019-02-25 15:24:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:27,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:27,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:27,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:27,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:27,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:27,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:27,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:27,460 INFO L87 Difference]: Start difference. First operand 59 states and 243 transitions. Second operand 8 states. [2019-02-25 15:24:28,179 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-02-25 15:24:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:28,646 INFO L93 Difference]: Finished difference Result 99 states and 302 transitions. [2019-02-25 15:24:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:28,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:28,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:28,648 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:24:28,648 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:24:28,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:24:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2019-02-25 15:24:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:24:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 261 transitions. [2019-02-25 15:24:28,663 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 261 transitions. Word has length 4 [2019-02-25 15:24:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:28,663 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 261 transitions. [2019-02-25 15:24:28,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 261 transitions. [2019-02-25 15:24:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:28,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:28,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:28,664 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 941660, now seen corresponding path program 1 times [2019-02-25 15:24:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:28,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:28,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:28,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:28,738 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:28,738 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [35] [2019-02-25 15:24:28,739 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:28,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:28,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:28,743 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:28,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:28,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:28,743 INFO 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-02-25 15:24:28,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:28,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:28,763 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:28,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:28,768 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:28,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,772 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:28,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:28,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:28,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,799 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:28,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,815 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:28,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,829 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:28,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:28,846 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,902 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,946 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,981 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,009 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,033 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,051 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,069 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:29,155 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,504 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,516 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,537 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,567 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,602 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,685 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,753 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:29,754 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:29,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,818 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:29,818 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,880 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:29,881 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:29,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,943 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:29,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:29,945 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,005 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:30,005 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:82 [2019-02-25 15:24:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:30,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:30,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:30,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:30,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:30,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:30,068 INFO L87 Difference]: Start difference. First operand 61 states and 261 transitions. Second operand 8 states. [2019-02-25 15:24:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:30,701 INFO L93 Difference]: Finished difference Result 101 states and 320 transitions. [2019-02-25 15:24:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:30,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:30,703 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:24:30,703 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:24:30,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:24:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2019-02-25 15:24:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-25 15:24:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 278 transitions. [2019-02-25 15:24:30,719 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 278 transitions. Word has length 4 [2019-02-25 15:24:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:30,720 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 278 transitions. [2019-02-25 15:24:30,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 278 transitions. [2019-02-25 15:24:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:30,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:30,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:30,721 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash 941288, now seen corresponding path program 1 times [2019-02-25 15:24:30,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:30,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:30,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:30,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:30,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:31,057 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2019-02-25 15:24:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:31,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:31,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:31,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:31,258 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [35] [2019-02-25 15:24:31,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:31,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:31,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:31,270 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:31,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:31,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:31,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:31,270 INFO 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-02-25 15:24:31,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:31,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:31,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:31,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:31,492 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:31,493 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,519 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,541 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,565 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,593 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,629 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,674 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,726 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:31,730 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:24:31,732 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:31,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:24:31,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:31,755 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:31,773 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:31,819 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:31,820 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,873 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,914 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,945 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,970 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,990 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,007 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,023 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,091 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,091 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:32,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,149 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:32,150 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,212 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,212 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:32,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,247 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:32,248 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,309 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,309 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:24:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:32,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:32,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:32,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:32,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:32,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:32,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:32,387 INFO L87 Difference]: Start difference. First operand 62 states and 278 transitions. Second operand 8 states. [2019-02-25 15:24:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:33,105 INFO L93 Difference]: Finished difference Result 106 states and 350 transitions. [2019-02-25 15:24:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:33,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:33,107 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:24:33,107 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:24:33,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:24:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 65. [2019-02-25 15:24:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:24:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 304 transitions. [2019-02-25 15:24:33,121 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 304 transitions. Word has length 4 [2019-02-25 15:24:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:33,121 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 304 transitions. [2019-02-25 15:24:33,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 304 transitions. [2019-02-25 15:24:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:33,122 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:33,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:33,123 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 941784, now seen corresponding path program 1 times [2019-02-25 15:24:33,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:33,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:33,335 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:24:33,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-02-25 15:24:33,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:33,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:33,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:33,348 INFO L207 CegarAbsIntRunner]: [0], [18], [30], [35] [2019-02-25 15:24:33,349 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:33,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:33,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:33,353 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:33,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:33,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:33,354 INFO 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-02-25 15:24:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:33,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:33,374 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:33,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:33,380 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:33,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,385 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:33,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:33,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:33,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,408 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:33,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,418 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:33,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,430 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:33,445 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:33,446 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,504 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,548 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,580 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,609 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,631 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,673 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,692 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:33,770 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,801 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,818 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,843 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,878 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,915 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,956 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:34,024 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:34,025 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:34,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,071 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:34,072 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:34,133 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:34,134 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:34,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:34,169 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:34,229 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:34,229 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:24:34,438 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-02-25 15:24:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:34,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:34,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:34,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:34,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:34,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:34,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:34,574 INFO L87 Difference]: Start difference. First operand 65 states and 304 transitions. Second operand 8 states. [2019-02-25 15:24:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:35,241 INFO L93 Difference]: Finished difference Result 107 states and 376 transitions. [2019-02-25 15:24:35,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:35,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:35,243 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:24:35,243 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:24:35,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:24:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 66. [2019-02-25 15:24:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:24:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 328 transitions. [2019-02-25 15:24:35,257 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 328 transitions. Word has length 4 [2019-02-25 15:24:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:35,257 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 328 transitions. [2019-02-25 15:24:35,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 328 transitions. [2019-02-25 15:24:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:35,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:35,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:35,259 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:35,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:35,259 INFO L82 PathProgramCache]: Analyzing trace with hash 930314, now seen corresponding path program 1 times [2019-02-25 15:24:35,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:35,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:35,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:35,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:35,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:35,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-02-25 15:24:35,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:35,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:35,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:35,374 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [35] [2019-02-25 15:24:35,375 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:35,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:35,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:35,379 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:35,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:35,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:35,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 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-02-25 15:24:35,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:35,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:35,402 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:35,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:35,532 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:35,532 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,554 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,564 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,581 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,611 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,643 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,687 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:35,741 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:24:35,745 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:35,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:24:35,751 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:35,755 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:35,759 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:35,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:35,770 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,823 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,863 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,894 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,919 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,939 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,955 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,970 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:36,039 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:36,039 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:36,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 129 [2019-02-25 15:24:36,084 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:36,306 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:36,306 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:201 [2019-02-25 15:24:36,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:36,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 25 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 111 treesize of output 153 [2019-02-25 15:24:36,454 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-02-25 15:24:36,473 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 64 xjuncts. [2019-02-25 15:24:37,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,572 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:37,574 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 120 [2019-02-25 15:24:37,574 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,971 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-1 vars, End of recursive call: 49 dim-0 vars, and 8 xjuncts. [2019-02-25 15:24:37,972 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 15 variables, input treesize:218, output treesize:686 [2019-02-25 15:24:39,243 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 114 [2019-02-25 15:24:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:39,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:39,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:39,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-25 15:24:39,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:39,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:24:39,273 INFO L87 Difference]: Start difference. First operand 66 states and 328 transitions. Second operand 8 states. [2019-02-25 15:24:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:43,069 INFO L93 Difference]: Finished difference Result 155 states and 556 transitions. [2019-02-25 15:24:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:24:43,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:43,072 INFO L225 Difference]: With dead ends: 155 [2019-02-25 15:24:43,072 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:24:43,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:24:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 78. [2019-02-25 15:24:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:24:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 438 transitions. [2019-02-25 15:24:43,088 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 438 transitions. Word has length 4 [2019-02-25 15:24:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:43,088 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 438 transitions. [2019-02-25 15:24:43,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 438 transitions. [2019-02-25 15:24:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:43,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:43,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:43,090 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 930440, now seen corresponding path program 1 times [2019-02-25 15:24:43,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:43,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:43,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:43,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:43,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:43,267 INFO L207 CegarAbsIntRunner]: [0], [6], [36], [37] [2019-02-25 15:24:43,268 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:43,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:43,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:43,273 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:24:43,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:43,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:43,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:43,274 INFO 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-02-25 15:24:43,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:43,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:43,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:43,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:43,292 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:43,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,297 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:43,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,304 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:43,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,310 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:43,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,318 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:43,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,331 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:43,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:43,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:43,356 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,413 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,457 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,493 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,522 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,545 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,565 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,583 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:43,659 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,681 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,697 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,719 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,743 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,776 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,818 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,886 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:43,887 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:43,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:43,924 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,984 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:43,984 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:44,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:44,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:44,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:44,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:44,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:44,031 INFO L87 Difference]: Start difference. First operand 78 states and 438 transitions. Second operand 6 states. [2019-02-25 15:24:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:44,361 INFO L93 Difference]: Finished difference Result 104 states and 471 transitions. [2019-02-25 15:24:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:44,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:24:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:44,363 INFO L225 Difference]: With dead ends: 104 [2019-02-25 15:24:44,364 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:24:44,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-02-25 15:24:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:24:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2019-02-25 15:24:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:24:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-02-25 15:24:44,384 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-02-25 15:24:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:44,384 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-02-25 15:24:44,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-02-25 15:24:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:44,385 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:44,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:44,385 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:44,385 INFO L82 PathProgramCache]: Analyzing trace with hash 945816, now seen corresponding path program 1 times [2019-02-25 15:24:44,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:44,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:44,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:44,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:44,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:44,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:44,503 INFO L207 CegarAbsIntRunner]: [0], [22], [36], [37] [2019-02-25 15:24:44,504 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:44,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:44,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:44,507 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:24:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:44,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:44,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:44,507 INFO 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-02-25 15:24:44,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:44,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:44,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:44,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:44,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:44,531 INFO L467 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 30 treesize of output 32 [2019-02-25 15:24:44,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,540 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-25 15:24:44,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,548 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:24:44,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,560 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:24:44,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:24:44,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,590 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:24:44,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:24:44,604 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,655 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,696 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,727 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,753 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,774 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,821 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,839 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:44,953 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,968 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,979 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,994 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,022 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,059 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,125 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,125 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:24:45,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,158 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 116 [2019-02-25 15:24:45,159 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,216 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,217 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-02-25 15:24:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:45,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:45,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:45,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:45,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:45,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:45,265 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 6 states. [2019-02-25 15:24:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:45,589 INFO L93 Difference]: Finished difference Result 108 states and 483 transitions. [2019-02-25 15:24:45,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:45,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:24:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:45,591 INFO L225 Difference]: With dead ends: 108 [2019-02-25 15:24:45,592 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:24:45,592 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-02-25 15:24:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:24:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-02-25 15:24:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:24:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-02-25 15:24:45,612 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-02-25 15:24:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:45,612 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-02-25 15:24:45,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-02-25 15:24:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:45,613 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:45,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:45,613 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:45,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:45,613 INFO L82 PathProgramCache]: Analyzing trace with hash 945008, now seen corresponding path program 1 times [2019-02-25 15:24:45,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:45,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:45,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:45,771 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-02-25 15:24:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:45,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:45,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:45,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:45,799 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [35] [2019-02-25 15:24:45,800 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:45,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:45,803 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:45,803 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:45,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:45,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:45,804 INFO 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-02-25 15:24:45,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:45,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:45,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:45,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:46,290 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:46,291 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,314 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,322 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,342 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,365 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,406 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,449 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,499 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:46,506 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:24:46,510 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:46,513 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:24:46,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:46,532 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:46,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:46,546 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:46,546 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,599 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,639 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,670 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,692 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,712 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,729 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,744 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,812 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:46,813 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:46,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:46,860 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,919 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:46,920 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:46,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,959 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:46,960 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,020 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:47,021 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:24:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:47,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:47,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:47,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:47,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:47,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:47,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:47,094 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 8 states. [2019-02-25 15:24:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:49,065 INFO L93 Difference]: Finished difference Result 154 states and 652 transitions. [2019-02-25 15:24:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:49,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:49,069 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:24:49,069 INFO L226 Difference]: Without dead ends: 153 [2019-02-25 15:24:49,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-25 15:24:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 92. [2019-02-25 15:24:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:24:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 556 transitions. [2019-02-25 15:24:49,086 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 556 transitions. Word has length 4 [2019-02-25 15:24:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:49,086 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 556 transitions. [2019-02-25 15:24:49,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 556 transitions. [2019-02-25 15:24:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:49,087 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:49,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:49,087 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash 945504, now seen corresponding path program 1 times [2019-02-25 15:24:49,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:49,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:49,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:49,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:49,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:49,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:49,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:49,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:49,236 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [35] [2019-02-25 15:24:49,237 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:49,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:49,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:49,240 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:49,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:49,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:49,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:24:49,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:49,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:49,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:49,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:49,262 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:49,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,265 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:49,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,270 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:49,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,279 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:49,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,309 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:49,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,319 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:49,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,333 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:49,362 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:49,363 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,421 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,464 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,498 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,526 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,549 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,565 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,582 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:49,659 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,681 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,690 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,707 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,733 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,761 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,802 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,870 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:49,871 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:49,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,952 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:49,953 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,675 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:50,675 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:50,851 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-02-25 15:24:50,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,865 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:50,865 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,924 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:50,924 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:24:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:50,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:51,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:51,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:51,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:51,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:51,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:51,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:51,015 INFO L87 Difference]: Start difference. First operand 92 states and 556 transitions. Second operand 8 states. [2019-02-25 15:24:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:51,727 INFO L93 Difference]: Finished difference Result 148 states and 688 transitions. [2019-02-25 15:24:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:51,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:51,729 INFO L225 Difference]: With dead ends: 148 [2019-02-25 15:24:51,730 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:24:51,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:24:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2019-02-25 15:24:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:24:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 590 transitions. [2019-02-25 15:24:51,750 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 590 transitions. Word has length 4 [2019-02-25 15:24:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:51,751 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 590 transitions. [2019-02-25 15:24:51,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 590 transitions. [2019-02-25 15:24:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:51,751 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:51,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:51,752 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 933972, now seen corresponding path program 1 times [2019-02-25 15:24:51,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:51,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:51,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:51,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:51,877 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:51,877 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [35] [2019-02-25 15:24:51,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:51,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:51,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:51,881 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:51,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:51,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:51,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:51,881 INFO 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-02-25 15:24:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:51,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:51,902 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:51,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:51,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:51,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,910 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:51,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,915 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:51,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:51,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,931 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:51,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:51,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:51,965 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:51,966 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,021 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,065 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,100 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,127 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,150 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,170 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,188 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:52,265 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,287 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,307 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,331 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,357 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,391 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,433 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,507 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:52,508 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:52,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,553 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:52,553 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,615 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:52,616 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:52,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,647 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:52,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:52,649 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,711 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:52,712 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:82 [2019-02-25 15:24:52,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-02-25 15:24:52,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:52,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:52,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:52,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:52,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:52,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:52,774 INFO L87 Difference]: Start difference. First operand 103 states and 590 transitions. Second operand 8 states. [2019-02-25 15:24:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:53,290 INFO L93 Difference]: Finished difference Result 145 states and 646 transitions. [2019-02-25 15:24:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:53,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:53,293 INFO L225 Difference]: With dead ends: 145 [2019-02-25 15:24:53,293 INFO L226 Difference]: Without dead ends: 143 [2019-02-25 15:24:53,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-25 15:24:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 104. [2019-02-25 15:24:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:24:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 599 transitions. [2019-02-25 15:24:53,318 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 599 transitions. Word has length 4 [2019-02-25 15:24:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:53,318 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 599 transitions. [2019-02-25 15:24:53,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 599 transitions. [2019-02-25 15:24:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:53,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:53,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:53,319 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash 938128, now seen corresponding path program 1 times [2019-02-25 15:24:53,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:53,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:53,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:53,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:53,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:53,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:53,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:53,388 INFO L207 CegarAbsIntRunner]: [0], [14], [36], [37] [2019-02-25 15:24:53,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:53,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:53,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:53,393 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:24:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:53,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:53,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:53,394 INFO 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-02-25 15:24:53,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:53,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:53,408 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:53,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:53,412 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:53,416 INFO L467 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 30 treesize of output 32 [2019-02-25 15:24:53,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,425 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-25 15:24:53,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:24:53,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,446 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:24:53,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,460 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:24:53,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,471 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:24:53,490 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:24:53,491 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,545 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,586 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,617 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,643 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,665 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,683 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,700 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,766 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:53,767 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,784 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,796 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,812 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,837 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,876 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,941 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:53,941 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:24:53,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:53,974 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 116 [2019-02-25 15:24:53,974 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,036 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:54,036 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-02-25 15:24:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:54,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:54,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:54,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:54,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:54,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:54,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:54,113 INFO L87 Difference]: Start difference. First operand 104 states and 599 transitions. Second operand 6 states. [2019-02-25 15:24:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:54,761 INFO L93 Difference]: Finished difference Result 124 states and 613 transitions. [2019-02-25 15:24:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:54,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:24:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:54,763 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:24:54,764 INFO L226 Difference]: Without dead ends: 123 [2019-02-25 15:24:54,764 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-02-25 15:24:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-25 15:24:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-02-25 15:24:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:24:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-02-25 15:24:54,782 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 4 [2019-02-25 15:24:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:54,783 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-02-25 15:24:54,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-02-25 15:24:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:54,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:54,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:54,784 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 937816, now seen corresponding path program 1 times [2019-02-25 15:24:54,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:54,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:54,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:54,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:54,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:54,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:54,958 INFO L207 CegarAbsIntRunner]: [0], [14], [26], [35] [2019-02-25 15:24:54,959 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:54,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:54,962 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:54,962 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:54,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:54,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:54,963 INFO 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-02-25 15:24:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:54,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:54,978 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:54,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:54,983 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:54,986 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,987 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:54,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:54,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,000 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:55,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,007 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:55,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,017 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:55,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,034 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:55,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:24:55,050 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,105 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,150 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,186 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,215 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,238 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,258 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,276 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:55,363 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,555 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,574 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,596 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,624 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,663 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,705 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,773 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:55,773 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:24:55,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:55,887 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,948 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:55,948 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:55,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:55,985 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,044 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:56,044 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:24:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:56,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:56,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:56,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:56,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:56,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:56,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:56,111 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 8 states. [2019-02-25 15:24:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:56,966 INFO L93 Difference]: Finished difference Result 176 states and 800 transitions. [2019-02-25 15:24:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:56,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:56,969 INFO L225 Difference]: With dead ends: 176 [2019-02-25 15:24:56,969 INFO L226 Difference]: Without dead ends: 174 [2019-02-25 15:24:56,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:24:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-25 15:24:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 108. [2019-02-25 15:24:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:24:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-02-25 15:24:56,995 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-02-25 15:24:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:56,995 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-02-25 15:24:56,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-02-25 15:24:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:56,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:56,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:56,996 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash 953504, now seen corresponding path program 1 times [2019-02-25 15:24:56,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:56,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:56,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:56,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:56,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:57,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:57,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:57,092 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:57,092 INFO L207 CegarAbsIntRunner]: [0], [30], [36], [37] [2019-02-25 15:24:57,093 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:57,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:57,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:57,096 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 2. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:24:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:57,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:57,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:57,097 INFO 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-02-25 15:24:57,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:57,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:57,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:57,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:57,146 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:57,147 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,163 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,182 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,204 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,238 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,279 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,327 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:57,331 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-02-25 15:24:57,335 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-25 15:24:57,338 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:24:57,343 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:24:57,347 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:24:57,356 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:24:57,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:24:57,397 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,447 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,485 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,514 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,537 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,555 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,571 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,586 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,651 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:57,651 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:24:57,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:57,686 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 116 [2019-02-25 15:24:57,686 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,742 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:57,743 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-02-25 15:24:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:57,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:57,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:57,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:57,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:57,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:57,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:57,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:57,819 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 6 states. [2019-02-25 15:24:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:58,138 INFO L93 Difference]: Finished difference Result 135 states and 696 transitions. [2019-02-25 15:24:58,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:58,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:24:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:58,140 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:24:58,140 INFO L226 Difference]: Without dead ends: 134 [2019-02-25 15:24:58,141 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-02-25 15:24:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-25 15:24:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 108. [2019-02-25 15:24:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:24:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-02-25 15:24:58,163 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-02-25 15:24:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:58,163 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-02-25 15:24:58,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-02-25 15:24:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:58,163 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:58,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:58,164 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:58,164 INFO L82 PathProgramCache]: Analyzing trace with hash 29600478, now seen corresponding path program 1 times [2019-02-25 15:24:58,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:58,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:58,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:58,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:58,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:58,436 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 16 [2019-02-25 15:24:58,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-02-25 15:24:58,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:58,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:58,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:58,529 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [35] [2019-02-25 15:24:58,530 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:58,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:58,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:58,533 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 2. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:58,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:58,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:58,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 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-02-25 15:24:58,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:58,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:58,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:24:58,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:58,552 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:24:58,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,556 INFO L467 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 30 treesize of output 36 [2019-02-25 15:24:58,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,561 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:24:58,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,568 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 60 [2019-02-25 15:24:58,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,575 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:24:58,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:24:58,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:24:58,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,609 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:24:58,609 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,693 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,735 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,770 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,798 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,822 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,842 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,859 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:24:58,950 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,980 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,991 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,008 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,038 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,080 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,125 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,186 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,278 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:59,278 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-02-25 15:24:59,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:24:59,318 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,406 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:59,406 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:125 [2019-02-25 15:24:59,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,448 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:59,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:24:59,450 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,537 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:59,538 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:107 [2019-02-25 15:24:59,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,593 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 157 [2019-02-25 15:24:59,593 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,679 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:59,679 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:89 [2019-02-25 15:24:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:59,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:59,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:59,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:24:59,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:59,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:59,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:59,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:59,767 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 10 states. [2019-02-25 15:25:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:01,156 INFO L93 Difference]: Finished difference Result 212 states and 968 transitions. [2019-02-25 15:25:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:25:01,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:01,159 INFO L225 Difference]: With dead ends: 212 [2019-02-25 15:25:01,159 INFO L226 Difference]: Without dead ends: 205 [2019-02-25 15:25:01,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-25 15:25:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 122. [2019-02-25 15:25:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-25 15:25:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 789 transitions. [2019-02-25 15:25:01,194 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 789 transitions. Word has length 5 [2019-02-25 15:25:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:01,194 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 789 transitions. [2019-02-25 15:25:01,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 789 transitions. [2019-02-25 15:25:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:01,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:01,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:01,195 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:01,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:01,196 INFO L82 PathProgramCache]: Analyzing trace with hash 29600106, now seen corresponding path program 1 times [2019-02-25 15:25:01,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:01,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:01,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:01,514 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-02-25 15:25:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:01,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:01,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:01,546 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:01,547 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [32], [35] [2019-02-25 15:25:01,547 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:01,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:01,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:01,550 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 2. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:01,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:01,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:01,551 INFO 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-02-25 15:25:01,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:01,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:01,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:25:01,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:01,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:25:01,677 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:01,712 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:01,734 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:01,768 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:01,819 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:01,876 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:01,952 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,030 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,111 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:25:02,114 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:25:02,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:25:02,122 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:25:02,125 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:25:02,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:25:02,131 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:25:02,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:25:02,135 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,214 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,255 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,286 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,311 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,331 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,349 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,365 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,462 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:02,462 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-02-25 15:25:02,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,502 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:25:02,503 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,592 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:02,592 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:125 [2019-02-25 15:25:02,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,640 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:02,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:25:02,642 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,728 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:02,728 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:107 [2019-02-25 15:25:02,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:02,778 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:02,779 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 157 [2019-02-25 15:25:02,779 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:02,864 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:02,864 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:97 [2019-02-25 15:25:02,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-02-25 15:25:02,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:02,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:02,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:02,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:02,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:02,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:02,972 INFO L87 Difference]: Start difference. First operand 122 states and 789 transitions. Second operand 10 states. [2019-02-25 15:25:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:04,813 INFO L93 Difference]: Finished difference Result 169 states and 850 transitions. [2019-02-25 15:25:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:04,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:04,816 INFO L225 Difference]: With dead ends: 169 [2019-02-25 15:25:04,816 INFO L226 Difference]: Without dead ends: 168 [2019-02-25 15:25:04,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-02-25 15:25:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2019-02-25 15:25:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-25 15:25:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 762 transitions. [2019-02-25 15:25:04,851 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 762 transitions. Word has length 5 [2019-02-25 15:25:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:04,851 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 762 transitions. [2019-02-25 15:25:04,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 762 transitions. [2019-02-25 15:25:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:04,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:04,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:04,852 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash 29600602, now seen corresponding path program 1 times [2019-02-25 15:25:04,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:04,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:04,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:04,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:04,993 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:04,994 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [32], [35] [2019-02-25 15:25:04,996 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:04,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:04,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:04,999 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 2. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:04,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:04,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:05,000 INFO 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-02-25 15:25:05,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:05,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:05,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:25:05,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:05,080 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:25:05,081 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,118 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,131 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,150 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,176 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,214 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,257 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,321 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,395 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:25:05,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:25:05,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:25:05,406 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:25:05,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:25:05,413 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:25:05,417 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:25:05,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:25:05,422 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,492 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,533 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,565 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,590 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,610 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,627 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,644 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,740 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:05,741 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-02-25 15:25:05,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:25:05,781 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,872 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:05,872 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:125 [2019-02-25 15:25:05,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,913 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:05,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:25:05,915 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,005 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,005 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:107 [2019-02-25 15:25:06,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,051 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:06,052 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 157 [2019-02-25 15:25:06,053 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,145 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,146 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:97 [2019-02-25 15:25:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:06,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:06,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:06,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:06,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:06,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:06,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:06,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:06,285 INFO L87 Difference]: Start difference. First operand 119 states and 762 transitions. Second operand 10 states. [2019-02-25 15:25:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:07,771 INFO L93 Difference]: Finished difference Result 176 states and 845 transitions. [2019-02-25 15:25:07,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:07,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:07,774 INFO L225 Difference]: With dead ends: 176 [2019-02-25 15:25:07,774 INFO L226 Difference]: Without dead ends: 172 [2019-02-25 15:25:07,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-02-25 15:25:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2019-02-25 15:25:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:25:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 788 transitions. [2019-02-25 15:25:07,803 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 788 transitions. Word has length 5 [2019-02-25 15:25:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:07,803 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 788 transitions. [2019-02-25 15:25:07,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 788 transitions. [2019-02-25 15:25:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:07,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:07,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:07,805 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:07,805 INFO L82 PathProgramCache]: Analyzing trace with hash 29588822, now seen corresponding path program 1 times [2019-02-25 15:25:07,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:07,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:07,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:07,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:07,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:07,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:07,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:07,960 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:07,960 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [35] [2019-02-25 15:25:07,961 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:07,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:07,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:07,963 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 2. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:07,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:07,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:07,963 INFO 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-02-25 15:25:07,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:07,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:07,978 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:25:07,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:08,017 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:08,018 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,042 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,060 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,079 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,104 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,143 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,187 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,236 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:25:08,239 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:25:08,243 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:25:08,246 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:25:08,250 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:25:08,253 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:25:08,257 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:25:08,273 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:25:08,274 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,325 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,365 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,396 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,421 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,440 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,457 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,473 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:08,541 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:08,541 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:25:08,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:08,638 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:25:08,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-02-25 15:25:08,675 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-02-25 15:25:10,233 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 41 dim-0 vars, and 8 xjuncts. [2019-02-25 15:25:10,234 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:830 [2019-02-25 15:25:10,695 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 427 DAG size of output: 164 [2019-02-25 15:25:10,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:10,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:10,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:10,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:10,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:10,707 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:10,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 144 [2019-02-25 15:25:10,709 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:10,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,028 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 130 [2019-02-25 15:25:11,029 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,247 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 158 [2019-02-25 15:25:11,248 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,445 INFO L301 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2019-02-25 15:25:11,445 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:333, output treesize:277 [2019-02-25 15:25:11,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,577 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:11,577 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 122 [2019-02-25 15:25:11,578 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,776 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 156 [2019-02-25 15:25:11,777 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:11,964 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 132 [2019-02-25 15:25:11,965 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,123 INFO L301 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 3 dim-1 vars, End of recursive call: 18 dim-0 vars, and 3 xjuncts. [2019-02-25 15:25:12,123 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 21 variables, input treesize:307, output treesize:239 [2019-02-25 15:25:12,413 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:25:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:12,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:12,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:12,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:25:12,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:12,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:12,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:25:12,458 INFO L87 Difference]: Start difference. First operand 125 states and 788 transitions. Second operand 10 states. [2019-02-25 15:25:12,921 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 113 [2019-02-25 15:25:21,871 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 147 [2019-02-25 15:25:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:25,225 INFO L93 Difference]: Finished difference Result 235 states and 1248 transitions. [2019-02-25 15:25:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:25:25,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:25,228 INFO L225 Difference]: With dead ends: 235 [2019-02-25 15:25:25,229 INFO L226 Difference]: Without dead ends: 230 [2019-02-25 15:25:25,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-25 15:25:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 145. [2019-02-25 15:25:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-25 15:25:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 973 transitions. [2019-02-25 15:25:25,266 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 973 transitions. Word has length 5 [2019-02-25 15:25:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:25,266 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 973 transitions. [2019-02-25 15:25:25,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 973 transitions. [2019-02-25 15:25:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:25,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:25,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:25,268 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29589382, now seen corresponding path program 1 times [2019-02-25 15:25:25,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:25,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:25,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:25,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:25,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:25,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:25,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:25,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:25,423 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [36], [37] [2019-02-25 15:25:25,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:25,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:25,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:25,427 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 2. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:25:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:25,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:25,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:25,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 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-02-25 15:25:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:25,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:25,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:25:25,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:25,682 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:25,683 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,704 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,711 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,728 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,751 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,785 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,829 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:25:25,885 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:25:25,888 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:25:25,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:25:25,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:25:25,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:25:25,902 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:25:25,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:25:25,915 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,968 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,008 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,040 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,064 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,084 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,101 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,115 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,183 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:26,184 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:25:26,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,275 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:25:26,276 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-02-25 15:25:26,302 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-02-25 15:25:27,843 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 41 dim-0 vars, and 8 xjuncts. [2019-02-25 15:25:27,843 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:828 [2019-02-25 15:25:28,189 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 427 DAG size of output: 164 [2019-02-25 15:25:28,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,223 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 146 [2019-02-25 15:25:28,224 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,438 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:28,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 152 [2019-02-25 15:25:28,439 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,650 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 122 [2019-02-25 15:25:28,650 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,828 INFO L301 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 3 dim-1 vars, End of recursive call: 18 dim-0 vars, and 3 xjuncts. [2019-02-25 15:25:28,829 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 21 variables, input treesize:333, output treesize:277 [2019-02-25 15:25:36,662 WARN L181 SmtUtils]: Spent 6.46 s on a formula simplification that was a NOOP. DAG size: 158 [2019-02-25 15:25:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:36,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:36,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:36,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:25:36,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:36,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:36,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:25:36,709 INFO L87 Difference]: Start difference. First operand 145 states and 973 transitions. Second operand 8 states. [2019-02-25 15:25:37,961 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:25:37,962 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-02-25 15:25:37,966 INFO L168 Benchmark]: Toolchain (without parser) took 144473.34 ms. Allocated memory was 138.9 MB in the beginning and 292.6 MB in the end (delta: 153.6 MB). Free memory was 106.5 MB in the beginning and 158.0 MB in the end (delta: -51.5 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:25:37,966 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:25:37,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.33 ms. Allocated memory is still 138.9 MB. Free memory was 106.3 MB in the beginning and 104.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:25:37,967 INFO L168 Benchmark]: Boogie Preprocessor took 41.11 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:25:37,967 INFO L168 Benchmark]: RCFGBuilder took 509.03 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 89.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-02-25 15:25:37,967 INFO L168 Benchmark]: TraceAbstraction took 143851.50 ms. Allocated memory was 138.9 MB in the beginning and 292.6 MB in the end (delta: 153.6 MB). Free memory was 89.4 MB in the beginning and 158.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2019-02-25 15:25:37,969 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 138.9 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.33 ms. Allocated memory is still 138.9 MB. Free memory was 106.3 MB in the beginning and 104.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.11 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 509.03 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 89.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 143851.50 ms. Allocated memory was 138.9 MB in the beginning and 292.6 MB in the end (delta: 153.6 MB). Free memory was 89.4 MB in the beginning and 158.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...