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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:39:55,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:39:55,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:39:55,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:39:55,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:39:55,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:39:55,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:39:55,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:39:55,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:39:55,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:39:55,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:39:55,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:39:55,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:39:55,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:39:55,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:39:55,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:39:55,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:39:55,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:39:55,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:39:55,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:39:55,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:39:55,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:39:55,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:39:55,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:39:55,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:39:55,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:39:55,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:39:55,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:39:55,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:39:55,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:39:55,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:39:55,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:39:55,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:39:55,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:39:55,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:39:55,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:39:55,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:39:55,426 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:39:55,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:39:55,428 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:39:55,428 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:39:55,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:39:55,429 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:39:55,432 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:39:55,432 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:39:55,432 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:39:55,432 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:39:55,432 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:39:55,433 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:39:55,433 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:39:55,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:39:55,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:39:55,434 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:39:55,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:39:55,435 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:39:55,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:39:55,435 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:39:55,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:39:55,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:39:55,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:39:55,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:39:55,438 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:39:55,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:39:55,438 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:39:55,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:39:55,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:39:55,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:39:55,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:39:55,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:39:55,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:39:55,439 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:39:55,439 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:39:55,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:39:55,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:39:55,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:39:55,440 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:39:55,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:39:55,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:39:55,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:39:55,507 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:39:55,507 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:39:55,508 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-03-04 16:39:55,508 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-03-04 16:39:55,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:39:55,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:39:55,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:39:55,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:39:55,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:39:55,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:39:55,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:39:55,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:39:55,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:39:55,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/1) ... [2019-03-04 16:39:55,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:39:55,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:39:55,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:39:55,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:39:55,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (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-03-04 16:39:55,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:39:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:39:56,124 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:39:56,124 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-03-04 16:39:56,125 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:39:56 BoogieIcfgContainer [2019-03-04 16:39:56,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:39:56,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:39:56,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:39:56,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:39:56,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:55" (1/2) ... [2019-03-04 16:39:56,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2686a930 and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:39:56, skipping insertion in model container [2019-03-04 16:39:56,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:39:56" (2/2) ... [2019-03-04 16:39:56,135 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-03-04 16:39:56,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:39:56,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-03-04 16:39:56,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-03-04 16:39:56,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:39:56,223 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:39:56,223 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:39:56,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:39:56,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:39:56,224 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:39:56,224 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:39:56,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:39:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-03-04 16:39:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:39:56,252 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:56,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:39:56,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-03-04 16:39:56,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:56,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:39:56,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:39:56,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:56,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:39:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:39:56,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:39:56,480 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-03-04 16:39:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:56,690 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-03-04 16:39:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:56,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:39:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:56,706 INFO L225 Difference]: With dead ends: 33 [2019-03-04 16:39:56,706 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:39:56,709 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-03-04 16:39:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:39:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-03-04 16:39:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:39:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-03-04 16:39:56,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-03-04 16:39:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:56,743 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-03-04 16:39:56,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:39:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-03-04 16:39:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:39:56,744 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:56,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:39:56,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-03-04 16:39:56,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:56,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:56,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:39:56,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:39:56,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:56,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:39:56,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:39:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:39:56,852 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-03-04 16:39:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:57,053 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-03-04 16:39:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:57,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:39:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:57,055 INFO L225 Difference]: With dead ends: 28 [2019-03-04 16:39:57,055 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:39:57,056 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-03-04 16:39:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:39:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-03-04 16:39:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:39:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-03-04 16:39:57,061 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-03-04 16:39:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:57,062 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-03-04 16:39:57,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:39:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-03-04 16:39:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:39:57,063 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:57,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:39:57,063 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-03-04 16:39:57,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:57,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:57,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:57,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:57,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,242 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-03-04 16:39:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:57,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:57,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:39:57,280 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-03-04 16:39:57,348 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:57,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:57,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:57,433 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:57,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:57,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:57,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,439 INFO 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-03-04 16:39:57,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:57,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:57,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:58,138 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:58,139 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,149 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,178 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,360 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,482 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,578 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,684 INFO L453 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 24 treesize of output 27 [2019-03-04 16:39:58,699 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:58,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:39:58,734 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:39:58,752 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:39:58,781 INFO L453 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 35 treesize of output 37 [2019-03-04 16:39:59,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:39:59,028 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,207 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,226 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,240 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,257 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,275 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,293 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,350 INFO L309 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-03-04 16:39:59,351 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:39:59,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:59,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,571 INFO L309 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-03-04 16:39:59,573 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:59,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:59,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:59,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:59,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:59,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:59,707 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-03-04 16:39:59,865 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-03-04 16:40:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:00,249 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-03-04 16:40:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:00,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:40:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:00,253 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:40:00,254 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:40:00,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:40:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:40:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-03-04 16:40:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:40:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-03-04 16:40:00,261 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-03-04 16:40:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:00,261 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-03-04 16:40:00,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-03-04 16:40:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:00,262 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:00,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:00,263 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-03-04 16:40:00,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:00,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:00,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:00,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:00,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:00,328 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-03-04 16:40:00,331 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:00,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:00,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:00,339 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:00,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:00,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,340 INFO 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-03-04 16:40:00,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:00,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:00,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:00,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:00,386 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:00,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,395 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:00,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:00,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,438 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:00,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,466 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:00,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,505 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:00,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:00,598 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,620 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,660 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,679 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,695 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,751 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,767 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:00,881 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,892 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,904 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,918 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,935 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,964 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,015 INFO L309 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-03-04 16:40:01,016 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:01,115 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:01,116 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,192 INFO L309 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-03-04 16:40:01,193 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,209 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:40:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:40:01,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:01,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:40:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:40:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:40:01,235 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-03-04 16:40:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:01,310 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-03-04 16:40:01,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:40:01,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:40:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:01,312 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:40:01,312 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:40:01,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:40:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:40:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-03-04 16:40:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:40:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-03-04 16:40:01,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-03-04 16:40:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:01,320 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-03-04 16:40:01,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:40:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-03-04 16:40:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:01,321 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:01,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:01,321 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:01,322 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-03-04 16:40:01,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:01,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:01,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:01,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:01,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:01,422 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-03-04 16:40:01,424 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:01,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:01,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:01,431 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:01,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:01,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:01,432 INFO 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-03-04 16:40:01,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:01,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:01,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:01,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:01,465 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:01,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,474 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:01,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:01,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,506 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:01,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,536 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:01,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,567 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:01,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:01,811 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,834 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,851 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,875 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,890 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,906 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,927 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:02,007 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,013 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,021 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,036 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,065 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,108 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,216 INFO L309 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-03-04 16:40:02,216 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:02,289 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:02,290 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,652 INFO L309 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-03-04 16:40:02,652 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:02,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:02,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:02,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:02,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:02,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:02,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:02,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:02,710 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-03-04 16:40:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:03,067 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-03-04 16:40:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:03,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:40:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:03,071 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:40:03,071 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:40:03,071 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-03-04 16:40:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:40:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-03-04 16:40:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:40:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-03-04 16:40:03,079 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-03-04 16:40:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:03,079 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-03-04 16:40:03,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-03-04 16:40:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:03,079 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:03,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:03,080 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:03,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:03,080 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-03-04 16:40:03,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:03,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:03,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:03,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:03,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:03,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:03,170 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:03,170 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-03-04 16:40:03,174 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:03,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:03,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:03,182 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:03,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:03,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:03,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:03,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:03,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:03,214 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:03,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:03,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:03,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,245 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:03,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,262 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:03,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,276 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:03,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,299 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:03,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,359 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:03,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,447 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:03,448 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,462 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,479 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,495 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,514 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,528 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,544 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:03,607 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,614 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,623 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,634 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,652 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,680 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,729 INFO L309 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-03-04 16:40:03,730 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:03,811 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:03,812 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,863 INFO L309 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-03-04 16:40:03,863 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:03,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:03,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:03,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:03,917 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-03-04 16:40:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:04,292 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-03-04 16:40:04,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:04,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:40:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:04,294 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:40:04,294 INFO L226 Difference]: Without dead ends: 57 [2019-03-04 16:40:04,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-03-04 16:40:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-03-04 16:40:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:40:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-03-04 16:40:04,302 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-03-04 16:40:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:04,302 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-03-04 16:40:04,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-03-04 16:40:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:04,303 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:04,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:04,303 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-03-04 16:40:04,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:04,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:04,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:04,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:40:04,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:40:04,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:04,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:40:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:40:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:40:04,405 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-03-04 16:40:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:04,655 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-03-04 16:40:04,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:40:04,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:40:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:04,657 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:40:04,657 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:40:04,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:40:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:40:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-03-04 16:40:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:40:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-03-04 16:40:04,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-03-04 16:40:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:04,666 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-03-04 16:40:04,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:40:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-03-04 16:40:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:04,666 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:04,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:04,667 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-03-04 16:40:04,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:04,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:04,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:04,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:04,831 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-03-04 16:40:04,833 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:04,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:04,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:04,841 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:04,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:04,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:04,841 INFO 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-03-04 16:40:04,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:04,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:04,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:04,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:04,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:04,955 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,995 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,016 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,041 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,076 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,112 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,156 INFO L453 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 24 treesize of output 27 [2019-03-04 16:40:05,161 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:05,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:05,170 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:40:05,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:40:05,183 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:05,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:05,241 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,256 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,272 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,286 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,303 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,319 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,335 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,393 INFO L309 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-03-04 16:40:05,393 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:05,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:05,439 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,483 INFO L309 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-03-04 16:40:05,484 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:40:05,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:40:05,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:05,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:40:05,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:40:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:40:05,535 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-03-04 16:40:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:05,635 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-03-04 16:40:05,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:40:05,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:40:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:05,637 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:40:05,637 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:40:05,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:40:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:40:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-03-04 16:40:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:40:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-03-04 16:40:05,645 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-03-04 16:40:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:05,646 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-03-04 16:40:05,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:40:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-03-04 16:40:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:05,647 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:05,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:05,647 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-03-04 16:40:05,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:05,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:05,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:05,736 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-03-04 16:40:05,737 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:05,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:05,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:05,748 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:05,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:05,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:05,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:05,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:05,777 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:05,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,786 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:05,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,797 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:05,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,831 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:05,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,851 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:05,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,886 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:05,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:05,979 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,992 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,008 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,023 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,037 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,053 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,070 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,150 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:06,151 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,161 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,174 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,188 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,210 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,238 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,294 INFO L309 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-03-04 16:40:06,295 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:06,434 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:06,435 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,478 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:06,479 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:06,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:06,521 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,561 INFO L309 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-03-04 16:40:06,561 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:40:06,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-03-04 16:40:06,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:06,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:06,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:06,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:06,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:06,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:06,654 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-03-04 16:40:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:07,203 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-03-04 16:40:07,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:07,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:07,205 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:40:07,205 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:40:07,206 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-03-04 16:40:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:40:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-03-04 16:40:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:40:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-03-04 16:40:07,215 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-03-04 16:40:07,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:07,216 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-03-04 16:40:07,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-03-04 16:40:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:07,216 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:07,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:07,217 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-03-04 16:40:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:07,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:07,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:07,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:07,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:07,309 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:07,310 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-03-04 16:40:07,312 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:07,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:07,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:07,317 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:07,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:07,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:07,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:07,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:07,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:07,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:07,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:07,392 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:07,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,420 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:07,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,429 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:07,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,444 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:07,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,467 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:07,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,491 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:07,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:07,557 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,575 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,601 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,617 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,636 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,650 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,665 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:07,733 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,738 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,746 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,764 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,785 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,815 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,868 INFO L309 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-03-04 16:40:07,868 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:07,970 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:07,971 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,020 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:08,021 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:08,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:08,063 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,098 INFO L309 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-03-04 16:40:08,099 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:40:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:08,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:08,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:08,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:08,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:08,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:08,195 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-03-04 16:40:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:08,655 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-03-04 16:40:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:08,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:08,664 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:40:08,664 INFO L226 Difference]: Without dead ends: 73 [2019-03-04 16:40:08,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-03-04 16:40:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-03-04 16:40:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:40:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-03-04 16:40:08,674 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-03-04 16:40:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:08,675 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-03-04 16:40:08,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-03-04 16:40:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:08,676 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:08,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:08,676 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-03-04 16:40:08,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:08,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:08,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:08,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:08,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:08,788 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-03-04 16:40:08,789 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:08,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:08,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:08,794 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:08,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:08,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:08,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:08,794 INFO 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-03-04 16:40:08,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:08,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:08,812 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:08,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:08,863 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:08,864 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,872 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,887 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,903 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,924 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,953 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,988 INFO L453 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 24 treesize of output 27 [2019-03-04 16:40:08,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:08,996 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:09,007 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:40:09,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:40:09,017 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:09,101 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:09,102 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,116 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,131 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,145 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,159 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,174 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,189 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,236 INFO L309 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-03-04 16:40:09,237 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:09,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:09,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,368 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:09,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:09,473 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:09,474 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,505 INFO L309 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-03-04 16:40:09,506 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:40:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:09,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:09,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:09,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:09,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:09,572 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-03-04 16:40:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:10,102 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-03-04 16:40:10,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:10,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:10,103 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:40:10,103 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:40:10,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:40:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-03-04 16:40:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:40:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-03-04 16:40:10,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-03-04 16:40:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:10,112 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-03-04 16:40:10,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-03-04 16:40:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:10,113 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:10,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:10,114 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-03-04 16:40:10,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:10,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:10,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:10,272 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-03-04 16:40:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:10,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:10,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:10,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:10,321 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-03-04 16:40:10,322 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:10,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:10,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:10,326 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:10,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:10,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:10,327 INFO 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-03-04 16:40:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:10,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:10,347 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:10,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:10,369 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:10,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,376 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:10,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:10,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,504 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:10,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,530 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:10,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,554 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:10,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:10,639 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,653 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,668 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,692 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,708 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,723 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,739 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:10,801 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,805 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,812 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,827 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,847 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,875 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,922 INFO L309 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-03-04 16:40:10,922 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:10,968 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:40:10,970 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:11,092 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:11,092 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:152 [2019-03-04 16:40:11,346 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-03-04 16:40:11,348 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 121 [2019-03-04 16:40:11,536 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-03-04 16:40:12,056 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-03-04 16:40:12,057 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:479 [2019-03-04 16:40:22,598 WARN L181 SmtUtils]: Spent 10.33 s on a formula simplification. DAG size of input: 275 DAG size of output: 128 [2019-03-04 16:40:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:22,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:22,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:22,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:40:22,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:22,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:22,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:22,655 INFO L87 Difference]: Start difference. First operand 40 states and 149 transitions. Second operand 8 states. [2019-03-04 16:40:23,916 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-03-04 16:40:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:33,993 INFO L93 Difference]: Finished difference Result 79 states and 233 transitions. [2019-03-04 16:40:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:33,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:33,995 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:40:33,995 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:40:33,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:40:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-03-04 16:40:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:40:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 177 transitions. [2019-03-04 16:40:34,005 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 177 transitions. Word has length 4 [2019-03-04 16:40:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:34,005 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 177 transitions. [2019-03-04 16:40:34,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 177 transitions. [2019-03-04 16:40:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:34,006 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:34,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:34,006 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-03-04 16:40:34,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:34,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:40:34,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:40:34,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:34,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:40:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:40:34,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:40:34,112 INFO L87 Difference]: Start difference. First operand 41 states and 177 transitions. Second operand 4 states. [2019-03-04 16:40:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:34,188 INFO L93 Difference]: Finished difference Result 53 states and 195 transitions. [2019-03-04 16:40:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:40:34,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:40:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:34,190 INFO L225 Difference]: With dead ends: 53 [2019-03-04 16:40:34,190 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:40:34,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:40:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:40:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-03-04 16:40:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:40:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 186 transitions. [2019-03-04 16:40:34,203 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 186 transitions. Word has length 4 [2019-03-04 16:40:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:34,203 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 186 transitions. [2019-03-04 16:40:34,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:40:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 186 transitions. [2019-03-04 16:40:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:34,204 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:34,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:34,204 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:34,204 INFO L82 PathProgramCache]: Analyzing trace with hash 929876, now seen corresponding path program 1 times [2019-03-04 16:40:34,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:34,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:34,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:34,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:34,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:34,310 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [31] [2019-03-04 16:40:34,311 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:34,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:34,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:34,315 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:34,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:34,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:34,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:34,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:34,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:34,339 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:34,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:34,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:34,405 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,415 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,426 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,476 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,498 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,527 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,562 INFO L453 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 24 treesize of output 27 [2019-03-04 16:40:34,566 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:34,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:34,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:40:34,583 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:40:34,586 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:34,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:34,666 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,679 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,752 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,764 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,777 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,791 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,805 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,849 INFO L309 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-03-04 16:40:34,850 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:34,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:34,896 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,950 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:34,950 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:34,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:34,988 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,018 INFO L309 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-03-04 16:40:35,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:40:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:35,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:35,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:35,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:40:35,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:35,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:35,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:35,067 INFO L87 Difference]: Start difference. First operand 43 states and 186 transitions. Second operand 8 states. [2019-03-04 16:40:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:36,113 INFO L93 Difference]: Finished difference Result 87 states and 278 transitions. [2019-03-04 16:40:36,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:36,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:36,115 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:40:36,115 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:40:36,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:40:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2019-03-04 16:40:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:40:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 149 transitions. [2019-03-04 16:40:36,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 149 transitions. Word has length 4 [2019-03-04 16:40:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:36,125 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 149 transitions. [2019-03-04 16:40:36,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 149 transitions. [2019-03-04 16:40:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:36,125 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:36,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:36,126 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-03-04 16:40:36,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:36,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:36,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:36,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:36,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:36,187 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [33] [2019-03-04 16:40:36,188 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:36,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:36,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:36,193 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:36,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:36,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:36,193 INFO 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-03-04 16:40:36,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:36,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:36,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:36,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:36,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:36,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,223 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:36,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:36,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,258 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:36,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,273 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:36,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,294 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:36,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,443 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:36,444 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,459 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,473 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,488 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,504 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,520 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,534 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:36,638 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,647 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,662 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,683 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,709 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,736 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,784 INFO L309 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-03-04 16:40:36,784 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:36,852 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:36,853 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,894 INFO L309 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-03-04 16:40:36,894 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:36,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:36,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:36,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:36,955 INFO L87 Difference]: Start difference. First operand 41 states and 149 transitions. Second operand 6 states. [2019-03-04 16:40:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:37,123 INFO L93 Difference]: Finished difference Result 64 states and 185 transitions. [2019-03-04 16:40:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:37,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:40:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:37,125 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:40:37,125 INFO L226 Difference]: Without dead ends: 63 [2019-03-04 16:40:37,126 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-03-04 16:40:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-03-04 16:40:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-03-04 16:40:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:40:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 157 transitions. [2019-03-04 16:40:37,135 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 157 transitions. Word has length 4 [2019-03-04 16:40:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:37,135 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 157 transitions. [2019-03-04 16:40:37,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 157 transitions. [2019-03-04 16:40:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:37,136 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:37,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:37,137 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:37,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-03-04 16:40:37,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,475 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-03-04 16:40:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:37,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:37,498 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [31] [2019-03-04 16:40:37,499 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:37,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:37,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:37,503 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:37,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,503 INFO 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-03-04 16:40:37,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:37,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:37,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:37,527 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:37,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,535 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:37,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:37,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,707 INFO L301 Elim1Store]: Index analysis took 131 ms [2019-03-04 16:40:37,709 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:37,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,964 INFO L301 Elim1Store]: Index analysis took 230 ms [2019-03-04 16:40:37,965 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:38,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,304 INFO L301 Elim1Store]: Index analysis took 314 ms [2019-03-04 16:40:38,306 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:38,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,677 INFO L301 Elim1Store]: Index analysis took 344 ms [2019-03-04 16:40:39,354 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:39,356 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,552 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,727 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,918 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,109 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,164 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,180 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:40,241 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,244 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,256 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,272 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,295 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,326 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,380 INFO L309 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-03-04 16:40:40,380 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:40,454 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:40,454 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,500 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:40,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:40,562 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:40,562 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,595 INFO L309 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-03-04 16:40:40,596 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:40:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:40,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:40,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:40,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:40:40,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:40,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:40,672 INFO L87 Difference]: Start difference. First operand 42 states and 157 transitions. Second operand 8 states. [2019-03-04 16:40:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:41,645 INFO L93 Difference]: Finished difference Result 98 states and 268 transitions. [2019-03-04 16:40:41,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:41,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:41,646 INFO L225 Difference]: With dead ends: 98 [2019-03-04 16:40:41,647 INFO L226 Difference]: Without dead ends: 97 [2019-03-04 16:40:41,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-03-04 16:40:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 47. [2019-03-04 16:40:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:40:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 197 transitions. [2019-03-04 16:40:41,661 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 197 transitions. Word has length 4 [2019-03-04 16:40:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:41,661 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 197 transitions. [2019-03-04 16:40:41,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 197 transitions. [2019-03-04 16:40:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:41,662 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:41,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:41,663 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:41,663 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-03-04 16:40:41,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:41,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:41,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:41,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:41,764 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [31] [2019-03-04 16:40:41,765 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:41,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:41,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:41,770 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:41,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:41,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:41,770 INFO 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-03-04 16:40:41,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:41,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:41,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:41,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:41,801 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:41,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,809 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:41,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,821 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:41,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,870 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:41,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,909 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:41,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,941 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:41,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,016 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:42,017 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,034 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,049 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,064 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,079 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,096 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,110 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,183 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:42,183 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,189 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,201 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,215 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,238 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,267 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,317 INFO L309 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-03-04 16:40:42,318 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:42,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:42,389 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,744 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:42,744 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:42,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:42,783 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,816 INFO L309 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-03-04 16:40:42,817 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:40:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:42,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:42,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:42,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:42,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:42,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:42,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:42,929 INFO L87 Difference]: Start difference. First operand 47 states and 197 transitions. Second operand 8 states. [2019-03-04 16:40:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:43,383 INFO L93 Difference]: Finished difference Result 91 states and 282 transitions. [2019-03-04 16:40:43,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:43,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:43,386 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:40:43,386 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:40:43,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:40:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-03-04 16:40:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:40:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 243 transitions. [2019-03-04 16:40:43,399 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 243 transitions. Word has length 4 [2019-03-04 16:40:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:43,400 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 243 transitions. [2019-03-04 16:40:43,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 243 transitions. [2019-03-04 16:40:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:43,401 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:43,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:43,401 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-03-04 16:40:43,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:43,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:43,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:43,538 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:40:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:43,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:43,549 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:43,549 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [31] [2019-03-04 16:40:43,551 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:43,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:43,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:43,555 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:43,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:43,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:43,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,556 INFO 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-03-04 16:40:43,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:43,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:43,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:43,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:43,793 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:43,793 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,819 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,943 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,106 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,371 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,471 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,507 INFO L453 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 24 treesize of output 27 [2019-03-04 16:40:44,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:44,518 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:44,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:40:44,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:40:44,529 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:44,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:44,578 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,593 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,606 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,620 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,670 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,685 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,698 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,747 INFO L309 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-03-04 16:40:44,747 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:44,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:44,796 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,840 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:44,840 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:44,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:44,889 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,923 INFO L309 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-03-04 16:40:44,924 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:40:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:44,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:44,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:44,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:44,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:44,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:44,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:44,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:44,985 INFO L87 Difference]: Start difference. First operand 56 states and 243 transitions. Second operand 8 states. [2019-03-04 16:40:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:45,408 INFO L93 Difference]: Finished difference Result 92 states and 291 transitions. [2019-03-04 16:40:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:45,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:45,409 INFO L225 Difference]: With dead ends: 92 [2019-03-04 16:40:45,410 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:40:45,410 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-03-04 16:40:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:40:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-03-04 16:40:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:40:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 254 transitions. [2019-03-04 16:40:45,425 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 254 transitions. Word has length 4 [2019-03-04 16:40:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:45,425 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 254 transitions. [2019-03-04 16:40:45,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 254 transitions. [2019-03-04 16:40:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:45,426 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:45,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:45,427 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:45,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-03-04 16:40:45,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:45,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:45,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:45,787 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-03-04 16:40:45,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-03-04 16:40:45,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:45,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:45,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:45,814 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [31] [2019-03-04 16:40:45,815 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:45,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:45,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:45,819 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:45,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:45,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:45,819 INFO 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-03-04 16:40:45,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:45,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:45,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:45,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:45,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:40:45,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,910 INFO L453 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 27 treesize of output 29 [2019-03-04 16:40:45,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:40:45,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,958 INFO L453 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 31 treesize of output 33 [2019-03-04 16:40:45,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,978 INFO L453 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 33 treesize of output 35 [2019-03-04 16:40:46,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,074 INFO L453 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 35 treesize of output 37 [2019-03-04 16:40:46,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:46,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:40:46,175 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,190 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,205 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,217 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,231 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,246 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,260 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:46,357 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,377 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,405 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,424 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,446 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,475 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,523 INFO L309 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-03-04 16:40:46,524 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:40:46,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:40:46,624 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:46,691 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:46,692 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:152 [2019-03-04 16:40:46,808 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 125 [2019-03-04 16:40:46,817 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:40:47,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-03-04 16:40:47,339 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,614 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-03-04 16:40:47,615 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-03-04 16:40:50,718 WARN L181 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-03-04 16:40:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:50,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:50,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:50,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:40:50,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:50,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:50,766 INFO L87 Difference]: Start difference. First operand 59 states and 254 transitions. Second operand 8 states. [2019-03-04 16:41:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:01,689 INFO L93 Difference]: Finished difference Result 101 states and 344 transitions. [2019-03-04 16:41:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:01,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:01,691 INFO L225 Difference]: With dead ends: 101 [2019-03-04 16:41:01,691 INFO L226 Difference]: Without dead ends: 100 [2019-03-04 16:41:01,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-03-04 16:41:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2019-03-04 16:41:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-03-04 16:41:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 286 transitions. [2019-03-04 16:41:01,708 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 286 transitions. Word has length 4 [2019-03-04 16:41:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:01,708 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 286 transitions. [2019-03-04 16:41:01,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 286 transitions. [2019-03-04 16:41:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:01,709 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:01,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:01,710 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash 951454, now seen corresponding path program 1 times [2019-03-04 16:41:01,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:01,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:01,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:01,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:01,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:01,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:01,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:01,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:01,761 INFO L207 CegarAbsIntRunner]: [0], [28], [32], [33] [2019-03-04 16:41:01,763 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:01,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:01,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:01,767 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:01,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:01,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:01,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:01,768 INFO 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-03-04 16:41:01,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:01,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:01,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:41:01,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:01,894 INFO L453 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:01,894 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,922 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,947 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,974 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,012 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,056 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,126 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,186 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:02,190 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:02,193 INFO L453 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 29 treesize of output 31 [2019-03-04 16:41:02,198 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:02,201 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:02,205 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:02,208 INFO L453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:41:02,209 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,351 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,364 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,378 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,392 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,405 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,419 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,484 INFO L309 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-03-04 16:41:02,485 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-03-04 16:41:02,507 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:02,508 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,569 INFO L309 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-03-04 16:41:02,569 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-03-04 16:41:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:02,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:02,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:02,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:41:02,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:02,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:41:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:41:02,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:41:02,645 INFO L87 Difference]: Start difference. First operand 63 states and 286 transitions. Second operand 6 states. [2019-03-04 16:41:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:02,873 INFO L93 Difference]: Finished difference Result 86 states and 322 transitions. [2019-03-04 16:41:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:41:02,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:41:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:02,875 INFO L225 Difference]: With dead ends: 86 [2019-03-04 16:41:02,875 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:41:02,876 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-03-04 16:41:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:41:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-03-04 16:41:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:41:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 294 transitions. [2019-03-04 16:41:02,887 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 294 transitions. Word has length 4 [2019-03-04 16:41:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:02,888 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 294 transitions. [2019-03-04 16:41:02,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:41:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 294 transitions. [2019-03-04 16:41:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:02,888 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:02,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:02,889 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:02,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 951266, now seen corresponding path program 2 times [2019-03-04 16:41:02,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:02,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:02,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:02,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:02,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:03,075 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-03-04 16:41:03,252 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:41:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:03,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:03,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:03,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:03,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:03,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:03,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:03,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:41:03,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:03,475 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:03,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:03,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:03,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,554 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:03,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,561 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:03,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,573 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:03,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,593 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:03,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,626 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:03,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:03,657 INFO L453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:41:03,658 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,673 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,688 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,715 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,732 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,748 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,763 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,857 INFO L453 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:03,858 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,868 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,884 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,910 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,944 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,981 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,024 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,394 INFO L309 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-03-04 16:41:04,395 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:41:04,422 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:04,423 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,485 INFO L309 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-03-04 16:41:04,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:41:04,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:41:04,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,580 INFO L309 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-03-04 16:41:04,581 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:41:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:04,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:04,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:41:04,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:04,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:04,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:04,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:04,640 INFO L87 Difference]: Start difference. First operand 64 states and 294 transitions. Second operand 8 states. [2019-03-04 16:41:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:05,256 INFO L93 Difference]: Finished difference Result 119 states and 384 transitions. [2019-03-04 16:41:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:05,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:05,259 INFO L225 Difference]: With dead ends: 119 [2019-03-04 16:41:05,259 INFO L226 Difference]: Without dead ends: 115 [2019-03-04 16:41:05,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-03-04 16:41:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2019-03-04 16:41:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:41:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 286 transitions. [2019-03-04 16:41:05,280 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 286 transitions. Word has length 4 [2019-03-04 16:41:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:05,280 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 286 transitions. [2019-03-04 16:41:05,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 286 transitions. [2019-03-04 16:41:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:05,281 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:05,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:05,281 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:05,282 INFO L82 PathProgramCache]: Analyzing trace with hash 938000, now seen corresponding path program 1 times [2019-03-04 16:41:05,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:05,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:05,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:05,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:05,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:05,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:05,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:05,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:05,379 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [33] [2019-03-04 16:41:05,382 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:05,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:05,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:05,386 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:05,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:05,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:05,389 INFO 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-03-04 16:41:05,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:05,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:05,402 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:05,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:05,409 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:05,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,415 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:05,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,433 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:05,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,450 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:05,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,468 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:05,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,491 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:05,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:05,583 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:05,584 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,600 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,616 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,632 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,646 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,662 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,690 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,771 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:05,772 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,807 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,816 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,832 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,851 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,887 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,936 INFO L309 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-03-04 16:41:05,937 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:08,053 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-03-04 16:41:08,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:08,059 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,101 INFO L309 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-03-04 16:41:08,102 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:08,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:08,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:08,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:41:08,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:08,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:41:08,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:41:08,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:41:08,322 INFO L87 Difference]: Start difference. First operand 67 states and 286 transitions. Second operand 6 states. [2019-03-04 16:41:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:08,564 INFO L93 Difference]: Finished difference Result 90 states and 322 transitions. [2019-03-04 16:41:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:41:08,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:41:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:08,569 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:41:08,569 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:41:08,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:41:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:41:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-03-04 16:41:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-03-04 16:41:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 294 transitions. [2019-03-04 16:41:08,587 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 294 transitions. Word has length 4 [2019-03-04 16:41:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:08,587 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 294 transitions. [2019-03-04 16:41:08,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:41:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 294 transitions. [2019-03-04 16:41:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:08,588 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:08,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:08,588 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash 29197230, now seen corresponding path program 1 times [2019-03-04 16:41:08,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:08,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:08,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:08,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:08,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:08,766 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:08,766 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [35] [2019-03-04 16:41:08,767 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:08,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:08,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:08,770 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:08,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:08,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:08,771 INFO 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-03-04 16:41:08,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:08,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:08,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:41:08,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:08,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:08,835 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,841 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,849 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,863 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,887 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,919 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:08,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:08,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 37 [2019-03-04 16:41:08,949 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:08,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:08,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:41:09,015 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:09,016 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,028 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,041 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,054 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,068 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,081 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,095 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,156 INFO L309 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-03-04 16:41:09,157 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-03-04 16:41:09,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:09,197 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,235 INFO L309 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-03-04 16:41:09,235 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:65 [2019-03-04 16:41:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:09,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:09,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:09,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 6 [2019-03-04 16:41:09,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:09,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:41:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:41:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:41:09,286 INFO L87 Difference]: Start difference. First operand 68 states and 294 transitions. Second operand 7 states. [2019-03-04 16:41:09,687 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-03-04 16:41:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:10,034 INFO L93 Difference]: Finished difference Result 77 states and 308 transitions. [2019-03-04 16:41:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:41:10,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-03-04 16:41:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:10,036 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:41:10,036 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:41:10,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:41:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-03-04 16:41:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-03-04 16:41:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 301 transitions. [2019-03-04 16:41:10,055 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 301 transitions. Word has length 5 [2019-03-04 16:41:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:10,055 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 301 transitions. [2019-03-04 16:41:10,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:41:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 301 transitions. [2019-03-04 16:41:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:10,056 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:10,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:10,056 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash 29172180, now seen corresponding path program 1 times [2019-03-04 16:41:10,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:10,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:10,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:10,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:10,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:10,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:10,145 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:10,145 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [33] [2019-03-04 16:41:10,146 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:10,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:10,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:10,150 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:10,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:10,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:10,150 INFO 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-03-04 16:41:10,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:10,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:10,184 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:10,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:10,214 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:10,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,261 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:10,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,276 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:10,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,287 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:10,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,304 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:10,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,327 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:10,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:10,402 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:10,403 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,417 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,432 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,446 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,461 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,475 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,490 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:10,551 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,556 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,566 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,582 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,600 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,628 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,675 INFO L309 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-03-04 16:41:10,675 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:10,721 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:10,722 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,763 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:10,764 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:10,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:41:10,802 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,833 INFO L309 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-03-04 16:41:10,834 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:41:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:10,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:10,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:10,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:10,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:10,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:10,893 INFO L87 Difference]: Start difference. First operand 69 states and 301 transitions. Second operand 8 states. [2019-03-04 16:41:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:11,341 INFO L93 Difference]: Finished difference Result 102 states and 353 transitions. [2019-03-04 16:41:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:11,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:11,342 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:41:11,342 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:41:11,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:41:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-03-04 16:41:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:41:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 317 transitions. [2019-03-04 16:41:11,362 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 317 transitions. Word has length 5 [2019-03-04 16:41:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:11,362 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 317 transitions. [2019-03-04 16:41:11,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 317 transitions. [2019-03-04 16:41:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:11,363 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:11,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:11,363 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash 29171496, now seen corresponding path program 1 times [2019-03-04 16:41:11,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:11,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:11,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:11,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:11,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:11,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:11,559 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [31] [2019-03-04 16:41:11,560 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:11,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:11,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:11,563 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:11,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:11,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:11,564 INFO 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-03-04 16:41:11,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:11,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:11,587 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:11,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:11,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:11,631 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,639 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,653 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,667 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,691 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,721 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,757 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:11,761 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:11,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:11,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:11,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:11,777 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:11,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:11,824 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,838 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,852 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,866 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,880 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,894 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,907 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,954 INFO L309 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-03-04 16:41:11,954 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:12,221 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-03-04 16:41:12,227 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:12,227 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,267 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:12,268 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:12,307 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:41:12,308 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,339 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:12,340 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:41:12,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:41:12,397 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,422 INFO L309 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-03-04 16:41:12,423 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:12,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:12,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:12,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:41:12,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:12,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:12,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:12,483 INFO L87 Difference]: Start difference. First operand 71 states and 317 transitions. Second operand 10 states. [2019-03-04 16:41:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:14,156 INFO L93 Difference]: Finished difference Result 147 states and 540 transitions. [2019-03-04 16:41:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:14,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:14,159 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:41:14,159 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:41:14,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:41:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2019-03-04 16:41:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-03-04 16:41:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 464 transitions. [2019-03-04 16:41:14,185 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 464 transitions. Word has length 5 [2019-03-04 16:41:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:14,185 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 464 transitions. [2019-03-04 16:41:14,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 464 transitions. [2019-03-04 16:41:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:14,186 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:14,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:14,186 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash 29187556, now seen corresponding path program 1 times [2019-03-04 16:41:14,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:14,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:14,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:14,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:14,369 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:14,369 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [33] [2019-03-04 16:41:14,370 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:14,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:14,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:14,373 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:14,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:14,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:14,374 INFO 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-03-04 16:41:14,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:14,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:14,388 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:14,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:14,416 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:14,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,420 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:14,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:14,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,440 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:14,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,456 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:14,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,482 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:14,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,586 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:14,587 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,601 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,616 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,630 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,646 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,661 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,678 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,740 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:14,741 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,747 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,756 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,774 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,799 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,826 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,874 INFO L309 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-03-04 16:41:14,875 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:14,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:14,912 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,967 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:14,968 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:15,001 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:41:15,002 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,035 INFO L309 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-03-04 16:41:15,035 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:41:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:15,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:15,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:15,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:15,135 INFO L87 Difference]: Start difference. First operand 89 states and 464 transitions. Second operand 8 states. [2019-03-04 16:41:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:15,589 INFO L93 Difference]: Finished difference Result 128 states and 531 transitions. [2019-03-04 16:41:15,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:15,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:15,591 INFO L225 Difference]: With dead ends: 128 [2019-03-04 16:41:15,591 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:41:15,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:41:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-03-04 16:41:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-03-04 16:41:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 488 transitions. [2019-03-04 16:41:15,621 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 488 transitions. Word has length 5 [2019-03-04 16:41:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:15,622 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 488 transitions. [2019-03-04 16:41:15,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 488 transitions. [2019-03-04 16:41:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:15,622 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:15,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:15,623 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 29187368, now seen corresponding path program 1 times [2019-03-04 16:41:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:15,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:15,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:15,853 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-03-04 16:41:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:15,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:15,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:15,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:15,894 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [31] [2019-03-04 16:41:15,894 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:15,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:15,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:15,899 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:15,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:15,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:15,900 INFO 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-03-04 16:41:15,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:15,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:15,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:15,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:15,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:15,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,935 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:15,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:15,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,954 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:15,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,971 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:15,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,994 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:15,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:16,059 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:16,060 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,074 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,089 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,104 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,118 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,134 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,148 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:16,206 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,216 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,228 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,243 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,265 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,291 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,338 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:16,338 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:16,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:16,428 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,627 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:16,627 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:16,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:41:16,680 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,724 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:16,725 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:41:16,819 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:41:16,820 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:16,846 INFO L309 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-03-04 16:41:16,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:16,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:16,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:16,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:16,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:16,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:16,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:16,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:16,945 INFO L87 Difference]: Start difference. First operand 92 states and 488 transitions. Second operand 10 states. [2019-03-04 16:41:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:17,802 INFO L93 Difference]: Finished difference Result 146 states and 591 transitions. [2019-03-04 16:41:17,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:17,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:17,804 INFO L225 Difference]: With dead ends: 146 [2019-03-04 16:41:17,804 INFO L226 Difference]: Without dead ends: 144 [2019-03-04 16:41:17,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-03-04 16:41:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2019-03-04 16:41:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-03-04 16:41:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 536 transitions. [2019-03-04 16:41:17,857 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 536 transitions. Word has length 5 [2019-03-04 16:41:17,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:17,857 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 536 transitions. [2019-03-04 16:41:17,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 536 transitions. [2019-03-04 16:41:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:17,858 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:17,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:17,859 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:17,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:17,859 INFO L82 PathProgramCache]: Analyzing trace with hash 29175836, now seen corresponding path program 1 times [2019-03-04 16:41:17,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:17,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:17,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:18,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:18,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:18,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:18,023 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [31] [2019-03-04 16:41:18,024 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:18,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:18,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:18,028 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:18,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:18,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:18,028 INFO 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-03-04 16:41:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:18,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:18,049 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:18,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:18,054 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:18,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,058 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:18,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:18,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,077 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:18,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,094 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:18,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,119 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:18,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:18,187 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,202 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,216 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,231 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,247 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,260 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,274 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:18,333 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,339 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,352 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,368 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,386 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,413 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,464 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:18,464 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:18,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:18,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,574 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:18,575 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:18,622 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:41:18,622 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,658 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:18,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:41:18,727 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 45 treesize of output 54 [2019-03-04 16:41:18,728 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,756 INFO L309 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-03-04 16:41:18,756 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:61 [2019-03-04 16:41:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:18,784 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:18,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:18,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:18,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:18,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:18,856 INFO L87 Difference]: Start difference. First operand 98 states and 536 transitions. Second operand 10 states. [2019-03-04 16:41:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:19,604 INFO L93 Difference]: Finished difference Result 140 states and 582 transitions. [2019-03-04 16:41:19,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:19,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:19,607 INFO L225 Difference]: With dead ends: 140 [2019-03-04 16:41:19,607 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:41:19,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:41:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:41:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2019-03-04 16:41:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-03-04 16:41:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 486 transitions. [2019-03-04 16:41:19,647 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 486 transitions. Word has length 5 [2019-03-04 16:41:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:19,647 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 486 transitions. [2019-03-04 16:41:19,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 486 transitions. [2019-03-04 16:41:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:19,647 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:19,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:19,648 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 29191274, now seen corresponding path program 1 times [2019-03-04 16:41:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:19,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:19,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:19,808 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-03-04 16:41:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:19,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:19,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:19,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:19,851 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [31] [2019-03-04 16:41:19,852 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:19,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:19,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:19,854 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:19,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:19,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:19,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:19,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:19,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:19,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:19,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:19,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:19,905 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,913 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,925 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,942 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,969 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,999 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,036 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:20,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:20,043 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:20,047 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:20,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:20,055 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:20,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:20,105 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,117 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,131 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,145 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,160 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,173 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,187 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,236 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:20,236 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:20,370 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:41:20,371 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:20,442 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:20,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:152 [2019-03-04 16:41:20,518 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 85 [2019-03-04 16:41:20,519 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:20,641 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 97 [2019-03-04 16:41:20,642 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:20,796 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-03-04 16:41:20,796 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:195 [2019-03-04 16:41:20,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 73 treesize of output 96 [2019-03-04 16:41:20,935 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 78 treesize of output 107 [2019-03-04 16:41:21,100 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-03-04 16:41:21,345 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-03-04 16:41:21,346 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:378 [2019-03-04 16:41:21,606 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 116 [2019-03-04 16:41:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:21,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:21,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:21,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:41:21,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:21,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:21,711 INFO L87 Difference]: Start difference. First operand 92 states and 486 transitions. Second operand 10 states. [2019-03-04 16:41:24,066 WARN L181 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-03-04 16:41:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:28,058 INFO L93 Difference]: Finished difference Result 155 states and 683 transitions. [2019-03-04 16:41:28,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:28,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:28,061 INFO L225 Difference]: With dead ends: 155 [2019-03-04 16:41:28,061 INFO L226 Difference]: Without dead ends: 154 [2019-03-04 16:41:28,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-03-04 16:41:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 98. [2019-03-04 16:41:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-03-04 16:41:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 534 transitions. [2019-03-04 16:41:28,101 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 534 transitions. Word has length 5 [2019-03-04 16:41:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:28,101 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 534 transitions. [2019-03-04 16:41:28,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 534 transitions. [2019-03-04 16:41:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:28,102 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:28,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:28,103 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash 29193322, now seen corresponding path program 1 times [2019-03-04 16:41:28,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:28,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:28,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:28,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:28,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:28,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:28,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:28,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:28,218 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [32], [33] [2019-03-04 16:41:28,219 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:28,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:28,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:28,222 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:28,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:28,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:28,222 INFO 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-03-04 16:41:28,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:28,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:28,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:28,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:28,345 INFO L453 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:28,346 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,353 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,363 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,383 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,408 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,444 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,488 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,540 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:28,544 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:28,549 INFO L453 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 29 treesize of output 31 [2019-03-04 16:41:28,553 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:28,557 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:28,561 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:28,564 INFO L453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:41:28,565 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,578 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,591 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,604 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,618 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,632 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,646 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,711 INFO L309 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-03-04 16:41:28,712 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:41:28,737 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:28,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,800 INFO L309 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-03-04 16:41:28,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:28,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:41:28,842 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,888 INFO L309 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-03-04 16:41:28,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:41:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:28,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:28,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:28,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:28,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:28,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:28,971 INFO L87 Difference]: Start difference. First operand 98 states and 534 transitions. Second operand 8 states. [2019-03-04 16:41:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:29,565 INFO L93 Difference]: Finished difference Result 137 states and 601 transitions. [2019-03-04 16:41:29,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:29,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:29,567 INFO L225 Difference]: With dead ends: 137 [2019-03-04 16:41:29,567 INFO L226 Difference]: Without dead ends: 132 [2019-03-04 16:41:29,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-03-04 16:41:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2019-03-04 16:41:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:41:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 556 transitions. [2019-03-04 16:41:29,608 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 556 transitions. Word has length 5 [2019-03-04 16:41:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:29,608 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 556 transitions. [2019-03-04 16:41:29,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 556 transitions. [2019-03-04 16:41:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:29,609 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:29,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:29,610 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:29,610 INFO L82 PathProgramCache]: Analyzing trace with hash 29193134, now seen corresponding path program 2 times [2019-03-04 16:41:29,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:29,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:29,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:29,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:29,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:29,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:29,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:29,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:29,685 INFO 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-03-04 16:41:29,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:29,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:29,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:41:29,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:29,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:41:29,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:29,896 INFO L453 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:29,896 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,900 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,911 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,928 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,966 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,993 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,037 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,091 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:30,094 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:30,098 INFO L453 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 29 treesize of output 31 [2019-03-04 16:41:30,102 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:30,105 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:30,110 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:30,113 INFO L453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:41:30,113 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,127 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,141 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,154 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,168 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,182 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,196 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,261 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,262 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-03-04 16:41:30,297 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:30,298 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,361 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,362 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:30,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:41:30,411 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,457 INFO L309 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-03-04 16:41:30,457 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-03-04 16:41:30,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 53 [2019-03-04 16:41:30,515 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,549 INFO L309 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-03-04 16:41:30,549 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:68 [2019-03-04 16:41:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:30,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:30,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:30,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:30,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:30,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:30,634 INFO L87 Difference]: Start difference. First operand 100 states and 556 transitions. Second operand 10 states. [2019-03-04 16:41:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:31,396 INFO L93 Difference]: Finished difference Result 154 states and 681 transitions. [2019-03-04 16:41:31,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:31,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:31,399 INFO L225 Difference]: With dead ends: 154 [2019-03-04 16:41:31,399 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:41:31,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:41:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2019-03-04 16:41:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-03-04 16:41:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 628 transitions. [2019-03-04 16:41:31,448 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 628 transitions. Word has length 5 [2019-03-04 16:41:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:31,448 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 628 transitions. [2019-03-04 16:41:31,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 628 transitions. [2019-03-04 16:41:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:31,449 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:31,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:31,450 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash 29179868, now seen corresponding path program 1 times [2019-03-04 16:41:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:31,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:31,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:31,791 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:41:32,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-03-04 16:41:32,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:32,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:32,025 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:32,025 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [32], [33] [2019-03-04 16:41:32,026 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:32,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:32,030 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:32,031 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:32,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:32,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:32,031 INFO 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-03-04 16:41:32,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:32,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:32,062 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:32,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:32,476 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:32,477 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,534 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,548 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,566 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,593 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,622 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,658 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:32,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:32,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:32,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:32,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:32,685 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:32,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:32,732 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,744 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,757 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,771 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,785 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,798 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,810 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,856 INFO L309 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-03-04 16:41:32,856 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:32,915 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:32,915 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,956 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:32,956 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:32,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:41:32,992 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,022 INFO L309 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-03-04 16:41:33,022 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:41:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:33,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:33,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-03-04 16:41:33,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:33,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:33,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:33,112 INFO L87 Difference]: Start difference. First operand 109 states and 628 transitions. Second operand 8 states. [2019-03-04 16:41:33,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:33,544 INFO L93 Difference]: Finished difference Result 140 states and 686 transitions. [2019-03-04 16:41:33,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:33,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:33,547 INFO L225 Difference]: With dead ends: 140 [2019-03-04 16:41:33,547 INFO L226 Difference]: Without dead ends: 139 [2019-03-04 16:41:33,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-03-04 16:41:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-03-04 16:41:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:41:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 652 transitions. [2019-03-04 16:41:33,599 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 652 transitions. Word has length 5 [2019-03-04 16:41:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:33,600 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 652 transitions. [2019-03-04 16:41:33,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 652 transitions. [2019-03-04 16:41:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:33,600 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:33,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:33,601 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:33,601 INFO L82 PathProgramCache]: Analyzing trace with hash 29179680, now seen corresponding path program 1 times [2019-03-04 16:41:33,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:33,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:33,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:33,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:33,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:33,772 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-03-04 16:41:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:33,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:33,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:33,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:33,824 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [26], [31] [2019-03-04 16:41:33,825 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:33,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:33,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:33,828 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:33,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:33,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:33,829 INFO 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-03-04 16:41:33,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:33,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:33,844 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:33,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:33,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:33,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,853 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:33,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:33,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,872 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:33,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,889 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:33,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,912 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:33,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:33,978 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,992 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,007 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,022 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,036 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,050 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,065 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,123 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:34,124 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,134 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,145 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,162 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,185 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,214 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,260 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:34,261 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:34,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:34,325 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:34,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:34,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:41:34,409 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,441 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:34,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:41:34,499 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:41:34,499 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,524 INFO L309 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-03-04 16:41:34,524 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:34,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:34,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:34,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:34,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:34,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:34,605 INFO L87 Difference]: Start difference. First operand 112 states and 652 transitions. Second operand 10 states. [2019-03-04 16:41:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:35,268 INFO L93 Difference]: Finished difference Result 161 states and 770 transitions. [2019-03-04 16:41:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:35,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:35,270 INFO L225 Difference]: With dead ends: 161 [2019-03-04 16:41:35,270 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:41:35,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:41:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2019-03-04 16:41:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:41:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 724 transitions. [2019-03-04 16:41:35,322 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 724 transitions. Word has length 5 [2019-03-04 16:41:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:35,323 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 724 transitions. [2019-03-04 16:41:35,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 724 transitions. [2019-03-04 16:41:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:35,323 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:35,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:35,324 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:35,324 INFO L82 PathProgramCache]: Analyzing trace with hash 28830064, now seen corresponding path program 1 times [2019-03-04 16:41:35,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:35,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:35,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:35,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:35,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:35,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:35,433 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [32], [33] [2019-03-04 16:41:35,434 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:35,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:35,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:35,440 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:35,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:35,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:35,441 INFO 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-03-04 16:41:35,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:35,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:35,454 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:35,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:35,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:35,510 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,523 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,547 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,573 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,609 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,652 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,698 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:35,702 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:35,704 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:35,707 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:35,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:35,713 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:35,760 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:35,761 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,772 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,786 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,800 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,815 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,830 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,844 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,895 INFO L309 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-03-04 16:41:35,895 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:35,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:35,942 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,987 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:35,987 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:36,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:36,099 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,130 INFO L309 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-03-04 16:41:36,131 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-03-04 16:41:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:36,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:36,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:36,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:36,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:36,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:36,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:36,192 INFO L87 Difference]: Start difference. First operand 121 states and 724 transitions. Second operand 8 states. [2019-03-04 16:41:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:36,610 INFO L93 Difference]: Finished difference Result 156 states and 773 transitions. [2019-03-04 16:41:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:36,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:36,613 INFO L225 Difference]: With dead ends: 156 [2019-03-04 16:41:36,613 INFO L226 Difference]: Without dead ends: 154 [2019-03-04 16:41:36,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-03-04 16:41:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2019-03-04 16:41:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-03-04 16:41:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 733 transitions. [2019-03-04 16:41:36,671 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 733 transitions. Word has length 5 [2019-03-04 16:41:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:36,671 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 733 transitions. [2019-03-04 16:41:36,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 733 transitions. [2019-03-04 16:41:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:36,672 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:36,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:36,672 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash 28818532, now seen corresponding path program 1 times [2019-03-04 16:41:36,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:36,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:36,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:36,799 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [32], [33] [2019-03-04 16:41:36,800 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:36,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:36,802 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:36,802 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:36,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:36,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:36,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:36,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:36,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:36,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:36,862 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,866 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,871 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,883 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,905 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,939 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,988 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:36,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:36,997 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:37,001 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:37,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:37,013 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:37,085 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:37,085 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,106 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,124 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,141 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,161 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,179 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,195 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,251 INFO L309 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-03-04 16:41:37,251 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:37,289 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:37,290 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,456 INFO L309 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-03-04 16:41:37,456 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:37,494 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:41:37,494 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,526 INFO L309 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-03-04 16:41:37,526 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:37,544 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:37,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:41:37,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:37,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:37,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:37,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:37,575 INFO L87 Difference]: Start difference. First operand 123 states and 733 transitions. Second operand 8 states. [2019-03-04 16:41:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:37,891 INFO L93 Difference]: Finished difference Result 168 states and 891 transitions. [2019-03-04 16:41:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:37,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:37,895 INFO L225 Difference]: With dead ends: 168 [2019-03-04 16:41:37,895 INFO L226 Difference]: Without dead ends: 167 [2019-03-04 16:41:37,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-03-04 16:41:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-03-04 16:41:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-03-04 16:41:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 865 transitions. [2019-03-04 16:41:37,978 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 865 transitions. Word has length 5 [2019-03-04 16:41:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:37,979 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 865 transitions. [2019-03-04 16:41:37,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 865 transitions. [2019-03-04 16:41:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:37,980 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:37,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:37,980 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 28818344, now seen corresponding path program 1 times [2019-03-04 16:41:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:37,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:38,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:38,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:38,240 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:38,240 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [26], [31] [2019-03-04 16:41:38,241 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:38,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:38,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:38,245 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:38,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:38,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:38,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:38,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:38,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:38,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:38,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:38,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:38,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,268 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:38,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,276 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:38,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,287 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:38,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,304 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:38,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,328 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:38,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:38,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:38,396 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,412 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,427 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,441 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,457 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,472 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,494 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,553 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:38,554 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,559 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,572 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,592 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,619 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,648 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,696 INFO L309 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-03-04 16:41:38,697 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:38,751 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:38,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,794 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:38,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:38,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:38,830 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:38,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:38,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:41:38,913 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,937 INFO L309 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-03-04 16:41:38,937 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:38,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:39,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:39,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:41:39,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:39,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:39,004 INFO L87 Difference]: Start difference. First operand 139 states and 865 transitions. Second operand 10 states. [2019-03-04 16:41:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:39,689 INFO L93 Difference]: Finished difference Result 242 states and 1262 transitions. [2019-03-04 16:41:39,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:39,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:39,693 INFO L225 Difference]: With dead ends: 242 [2019-03-04 16:41:39,693 INFO L226 Difference]: Without dead ends: 240 [2019-03-04 16:41:39,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:41:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-03-04 16:41:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2019-03-04 16:41:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:41:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1177 transitions. [2019-03-04 16:41:39,769 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1177 transitions. Word has length 5 [2019-03-04 16:41:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:39,769 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1177 transitions. [2019-03-04 16:41:39,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1177 transitions. [2019-03-04 16:41:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:39,770 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:39,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:39,770 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,770 INFO L82 PathProgramCache]: Analyzing trace with hash 28835830, now seen corresponding path program 1 times [2019-03-04 16:41:39,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:39,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:39,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,944 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-03-04 16:41:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:39,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:39,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:39,958 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [32], [33] [2019-03-04 16:41:39,959 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:39,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:39,962 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:39,962 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:39,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:39,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:39,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:39,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,977 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:39,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:39,983 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:39,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,989 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:39,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:40,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,108 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:40,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,135 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:40,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,166 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:40,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:40,198 INFO L453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:41:40,198 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,215 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,230 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,246 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,262 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,278 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,293 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,365 INFO L453 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:40,365 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,373 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,384 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,404 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,437 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,479 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,524 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,593 INFO L309 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-03-04 16:41:40,593 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:41:40,621 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:40,622 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,685 INFO L309 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-03-04 16:41:40,686 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:41:40,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:41:40,726 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,773 INFO L309 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-03-04 16:41:40,773 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-03-04 16:41:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:40,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:40,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:40,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:40,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:40,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:40,840 INFO L87 Difference]: Start difference. First operand 178 states and 1177 transitions. Second operand 8 states. [2019-03-04 16:41:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:41,467 INFO L93 Difference]: Finished difference Result 211 states and 1231 transitions. [2019-03-04 16:41:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:41,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:41,471 INFO L225 Difference]: With dead ends: 211 [2019-03-04 16:41:41,471 INFO L226 Difference]: Without dead ends: 203 [2019-03-04 16:41:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-03-04 16:41:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-03-04 16:41:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-03-04 16:41:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 1188 transitions. [2019-03-04 16:41:41,550 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 1188 transitions. Word has length 5 [2019-03-04 16:41:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:41,550 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 1188 transitions. [2019-03-04 16:41:41,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 1188 transitions. [2019-03-04 16:41:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:41,551 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:41,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:41,551 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash 28822376, now seen corresponding path program 1 times [2019-03-04 16:41:41,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:41,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:41,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:41,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:41,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:41,639 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:41,639 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [32], [33] [2019-03-04 16:41:41,641 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:41,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:41,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:41,644 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:41,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:41,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:41,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:41,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:41,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:41,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:41,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:41,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:41,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,674 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:41,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:41,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,697 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:41,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,713 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:41,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,737 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:41,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:41,803 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:41,804 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,820 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,836 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,852 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,868 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,882 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,897 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,959 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:41,959 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,967 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,983 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,001 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,024 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,054 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,123 INFO L309 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-03-04 16:41:42,124 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:42,200 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:42,201 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,266 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:42,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:42,335 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:42,335 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,366 INFO L309 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-03-04 16:41:42,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-03-04 16:41:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:42,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:42,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:42,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:42,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:42,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:42,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:42,429 INFO L87 Difference]: Start difference. First operand 176 states and 1188 transitions. Second operand 8 states. [2019-03-04 16:41:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:42,878 INFO L93 Difference]: Finished difference Result 201 states and 1233 transitions. [2019-03-04 16:41:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:42,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:42,881 INFO L225 Difference]: With dead ends: 201 [2019-03-04 16:41:42,881 INFO L226 Difference]: Without dead ends: 200 [2019-03-04 16:41:42,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-03-04 16:41:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2019-03-04 16:41:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:41:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1204 transitions. [2019-03-04 16:41:42,953 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1204 transitions. Word has length 5 [2019-03-04 16:41:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:42,954 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1204 transitions. [2019-03-04 16:41:42,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1204 transitions. [2019-03-04 16:41:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:42,955 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:42,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:42,955 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:42,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash 29302192, now seen corresponding path program 1 times [2019-03-04 16:41:42,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:42,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:42,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:43,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:43,084 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:43,084 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [31] [2019-03-04 16:41:43,085 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:43,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:43,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:43,087 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:43,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:43,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:43,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:43,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:43,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:43,101 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:43,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:43,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:43,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,112 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:43,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,119 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:43,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,132 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:43,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,150 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:43,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,174 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:43,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:43,240 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,255 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,271 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,287 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,302 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,316 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,332 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:43,392 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,394 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,406 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,424 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,449 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,477 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,524 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:43,524 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:43,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:43,580 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,623 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:43,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:43,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:41:43,662 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,691 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:43,692 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:43,751 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:41:43,752 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,777 INFO L309 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-03-04 16:41:43,778 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:43,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:43,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:43,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:43,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:43,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:43,855 INFO L87 Difference]: Start difference. First operand 178 states and 1204 transitions. Second operand 10 states. [2019-03-04 16:41:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:44,603 INFO L93 Difference]: Finished difference Result 245 states and 1358 transitions. [2019-03-04 16:41:44,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:44,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:44,607 INFO L225 Difference]: With dead ends: 245 [2019-03-04 16:41:44,607 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 16:41:44,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 16:41:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2019-03-04 16:41:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-03-04 16:41:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1287 transitions. [2019-03-04 16:41:44,688 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1287 transitions. Word has length 5 [2019-03-04 16:41:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:44,688 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1287 transitions. [2019-03-04 16:41:44,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1287 transitions. [2019-03-04 16:41:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:44,689 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:44,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:44,689 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:44,689 INFO L82 PathProgramCache]: Analyzing trace with hash 29295188, now seen corresponding path program 1 times [2019-03-04 16:41:44,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:44,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:44,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:44,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:44,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:44,885 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-03-04 16:41:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:44,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:44,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:44,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:44,898 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [32], [33] [2019-03-04 16:41:44,898 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:44,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:44,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:44,902 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:44,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:44,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:44,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:44,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:44,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:44,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:44,949 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:44,949 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:44,956 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:44,965 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:44,983 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,009 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,037 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,084 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:45,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:45,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:45,094 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:45,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:45,101 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:45,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:45,148 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,160 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,173 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,187 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,200 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,213 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,227 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,273 INFO L309 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-03-04 16:41:45,273 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:45,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:45,307 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,348 INFO L309 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-03-04 16:41:45,349 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:45,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:45,382 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,413 INFO L309 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-03-04 16:41:45,414 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:45,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:45,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:45,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-03-04 16:41:45,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:45,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:41:45,455 INFO L87 Difference]: Start difference. First operand 191 states and 1287 transitions. Second operand 8 states. [2019-03-04 16:41:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:45,821 INFO L93 Difference]: Finished difference Result 343 states and 2333 transitions. [2019-03-04 16:41:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:45,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:45,825 INFO L225 Difference]: With dead ends: 343 [2019-03-04 16:41:45,825 INFO L226 Difference]: Without dead ends: 342 [2019-03-04 16:41:45,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:41:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-03-04 16:41:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 304. [2019-03-04 16:41:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-03-04 16:41:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 2201 transitions. [2019-03-04 16:41:45,951 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 2201 transitions. Word has length 5 [2019-03-04 16:41:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:45,951 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 2201 transitions. [2019-03-04 16:41:45,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 2201 transitions. [2019-03-04 16:41:45,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:45,952 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:45,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:45,953 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash 29295000, now seen corresponding path program 1 times [2019-03-04 16:41:45,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:45,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:45,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:46,385 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-03-04 16:41:46,698 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-03-04 16:41:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:46,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:46,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:46,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:46,807 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [26], [31] [2019-03-04 16:41:46,808 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:46,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:46,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:46,811 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:46,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:46,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:46,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:46,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:46,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:46,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:46,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:46,875 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:46,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,878 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:46,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:46,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,897 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:46,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,913 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:46,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,935 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:46,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,999 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:47,000 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,015 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,029 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,044 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,058 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,072 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,088 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:47,148 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,151 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,157 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,171 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,201 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,236 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,293 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:47,294 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:47,373 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:47,373 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,428 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:47,428 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:47,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:41:47,473 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:47,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:47,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:41:47,576 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,600 INFO L309 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-03-04 16:41:47,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:47,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:47,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:47,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:47,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:47,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:47,678 INFO L87 Difference]: Start difference. First operand 304 states and 2201 transitions. Second operand 10 states. [2019-03-04 16:41:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:49,324 INFO L93 Difference]: Finished difference Result 369 states and 2390 transitions. [2019-03-04 16:41:49,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:49,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:49,330 INFO L225 Difference]: With dead ends: 369 [2019-03-04 16:41:49,330 INFO L226 Difference]: Without dead ends: 367 [2019-03-04 16:41:49,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-03-04 16:41:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 320. [2019-03-04 16:41:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-03-04 16:41:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 2329 transitions. [2019-03-04 16:41:49,450 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 2329 transitions. Word has length 5 [2019-03-04 16:41:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:49,450 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 2329 transitions. [2019-03-04 16:41:49,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 2329 transitions. [2019-03-04 16:41:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:49,451 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:49,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:49,451 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:49,452 INFO L82 PathProgramCache]: Analyzing trace with hash 29312486, now seen corresponding path program 1 times [2019-03-04 16:41:49,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:49,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:49,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:49,806 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-03-04 16:41:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:49,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:49,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:49,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:49,817 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [32], [33] [2019-03-04 16:41:49,818 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:49,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:49,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:49,820 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:49,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:49,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:49,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:49,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:49,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:49,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:49,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:49,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:49,905 INFO L453 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:49,905 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,914 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,926 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,950 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,984 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,017 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,068 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,131 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:50,135 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:50,139 INFO L453 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 29 treesize of output 31 [2019-03-04 16:41:50,143 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:50,147 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:50,151 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:50,171 INFO L453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:41:50,171 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,185 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,199 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,212 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,226 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,240 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,254 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,319 INFO L309 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-03-04 16:41:50,319 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:41:50,347 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:50,348 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,409 INFO L309 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-03-04 16:41:50,409 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:41:50,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:41:50,456 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:50,502 INFO L309 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-03-04 16:41:50,502 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-03-04 16:41:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:50,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:50,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:50,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:50,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:50,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:50,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:50,585 INFO L87 Difference]: Start difference. First operand 320 states and 2329 transitions. Second operand 8 states. [2019-03-04 16:41:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:51,208 INFO L93 Difference]: Finished difference Result 354 states and 2377 transitions. [2019-03-04 16:41:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:51,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:51,214 INFO L225 Difference]: With dead ends: 354 [2019-03-04 16:41:51,214 INFO L226 Difference]: Without dead ends: 350 [2019-03-04 16:41:51,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-03-04 16:41:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 323. [2019-03-04 16:41:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-03-04 16:41:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 2346 transitions. [2019-03-04 16:41:51,330 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 2346 transitions. Word has length 5 [2019-03-04 16:41:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:51,330 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 2346 transitions. [2019-03-04 16:41:51,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 2346 transitions. [2019-03-04 16:41:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:51,331 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:51,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:51,331 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 29299032, now seen corresponding path program 1 times [2019-03-04 16:41:51,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:51,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:51,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:51,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:51,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:51,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:51,414 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [32], [33] [2019-03-04 16:41:51,414 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:51,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:51,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:51,417 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:51,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:51,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:51,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:51,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:51,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:51,438 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:51,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:51,443 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:51,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,451 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:51,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,459 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:51,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,470 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:51,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,489 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:51,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,512 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:51,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,578 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:51,579 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,593 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,608 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,624 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,639 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,653 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,667 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:51,726 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,730 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,737 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,758 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,775 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,803 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,850 INFO L309 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-03-04 16:41:51,851 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:51,891 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:51,891 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,932 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:51,933 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:51,999 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:52,000 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,033 INFO L309 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-03-04 16:41:52,033 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-03-04 16:41:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:52,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:52,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:52,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:52,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:52,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:52,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:52,094 INFO L87 Difference]: Start difference. First operand 323 states and 2346 transitions. Second operand 8 states. [2019-03-04 16:41:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:52,680 INFO L93 Difference]: Finished difference Result 347 states and 2375 transitions. [2019-03-04 16:41:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:52,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:41:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:52,685 INFO L225 Difference]: With dead ends: 347 [2019-03-04 16:41:52,686 INFO L226 Difference]: Without dead ends: 346 [2019-03-04 16:41:52,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-03-04 16:41:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 324. [2019-03-04 16:41:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-03-04 16:41:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-03-04 16:41:52,831 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-03-04 16:41:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:52,831 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-03-04 16:41:52,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-03-04 16:41:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:52,832 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:52,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:52,833 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 28958902, now seen corresponding path program 1 times [2019-03-04 16:41:52,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:52,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:52,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:52,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:52,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:52,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:52,938 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [34], [35] [2019-03-04 16:41:52,939 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:52,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:52,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:52,943 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:52,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:52,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:52,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:52,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:52,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:52,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:53,030 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:53,031 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,039 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,050 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,067 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,093 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,137 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,184 INFO L453 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 24 treesize of output 27 [2019-03-04 16:41:53,188 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:53,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:53,195 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:53,198 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:41:53,201 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:53,249 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:53,250 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,264 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,278 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,291 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,305 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,318 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,332 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,378 INFO L309 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-03-04 16:41:53,379 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:53,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:53,428 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,471 INFO L309 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-03-04 16:41:53,471 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:41:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:53,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:53,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-03-04 16:41:53,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:53,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:41:53,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:53,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:41:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:41:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:41:53,521 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 6 states. [2019-03-04 16:41:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:53,827 INFO L93 Difference]: Finished difference Result 344 states and 2373 transitions. [2019-03-04 16:41:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:41:53,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:41:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:53,832 INFO L225 Difference]: With dead ends: 344 [2019-03-04 16:41:53,832 INFO L226 Difference]: Without dead ends: 343 [2019-03-04 16:41:53,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:41:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-03-04 16:41:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 324. [2019-03-04 16:41:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-03-04 16:41:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-03-04 16:41:53,948 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-03-04 16:41:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:53,949 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-03-04 16:41:53,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:41:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-03-04 16:41:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:53,949 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:53,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:53,950 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash 28945258, now seen corresponding path program 1 times [2019-03-04 16:41:53,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:53,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:53,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:53,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:53,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:54,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:54,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:54,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:41:54,112 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [31] [2019-03-04 16:41:54,113 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:54,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:54,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:54,115 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:54,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:54,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:54,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:54,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:54,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:54,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:54,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:54,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:54,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,153 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:54,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,161 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:54,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,174 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:54,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,190 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:54,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,214 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:54,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:54,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:41:54,281 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,296 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,312 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,326 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,342 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,357 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,371 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:54,429 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,436 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,452 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,472 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,493 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,522 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,569 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:54,569 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:41:54,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:41:54,624 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:54,697 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:54,698 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:152 [2019-03-04 16:41:54,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 85 [2019-03-04 16:41:54,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,913 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 97 [2019-03-04 16:41:54,915 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:55,067 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-03-04 16:41:55,067 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:195 [2019-03-04 16:41:55,203 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 73 treesize of output 96 [2019-03-04 16:41:55,204 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 78 treesize of output 107 [2019-03-04 16:41:55,368 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-03-04 16:41:55,617 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-03-04 16:41:55,617 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:378 [2019-03-04 16:41:56,183 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 118 [2019-03-04 16:41:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:56,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:56,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:56,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:41:56,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:56,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:56,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:56,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:56,255 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 10 states. [2019-03-04 16:41:56,726 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2019-03-04 16:41:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:58,769 INFO L93 Difference]: Finished difference Result 434 states and 2876 transitions. [2019-03-04 16:41:58,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:58,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:41:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:58,774 INFO L225 Difference]: With dead ends: 434 [2019-03-04 16:41:58,775 INFO L226 Difference]: Without dead ends: 432 [2019-03-04 16:41:58,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-03-04 16:41:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 339. [2019-03-04 16:41:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-03-04 16:41:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 2453 transitions. [2019-03-04 16:41:58,917 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 2453 transitions. Word has length 5 [2019-03-04 16:41:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:58,918 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 2453 transitions. [2019-03-04 16:41:58,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 2453 transitions. [2019-03-04 16:41:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:41:58,919 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:58,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:41:58,919 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash 28933852, now seen corresponding path program 2 times [2019-03-04 16:41:58,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:58,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:58,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:58,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:58,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:58,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:58,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:58,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:58,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:58,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:58,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:58,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:41:58,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:58,995 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:58,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:59,001 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:41:59,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,009 INFO L453 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 27 treesize of output 29 [2019-03-04 16:41:59,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:41:59,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,042 INFO L453 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 31 treesize of output 33 [2019-03-04 16:41:59,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,062 INFO L453 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 33 treesize of output 35 [2019-03-04 16:41:59,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,087 INFO L453 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 35 treesize of output 37 [2019-03-04 16:41:59,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,119 INFO L453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:41:59,119 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,135 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,152 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,168 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,183 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,199 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,214 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,286 INFO L453 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:59,286 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,296 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,307 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,325 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,347 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,375 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,418 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,484 INFO L309 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-03-04 16:41:59,485 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-03-04 16:41:59,504 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:59,505 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,569 INFO L309 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-03-04 16:41:59,570 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:59,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 46 [2019-03-04 16:41:59,602 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,647 INFO L309 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-03-04 16:41:59,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:41:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:59,669 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:59,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:59,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:41:59,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:59,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:59,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:59,702 INFO L87 Difference]: Start difference. First operand 339 states and 2453 transitions. Second operand 8 states. [2019-03-04 16:42:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:00,890 INFO L93 Difference]: Finished difference Result 472 states and 3201 transitions. [2019-03-04 16:42:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:00,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:42:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:00,896 INFO L225 Difference]: With dead ends: 472 [2019-03-04 16:42:00,896 INFO L226 Difference]: Without dead ends: 471 [2019-03-04 16:42:00,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:42:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-03-04 16:42:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 396. [2019-03-04 16:42:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-03-04 16:42:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 2917 transitions. [2019-03-04 16:42:01,043 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 2917 transitions. Word has length 5 [2019-03-04 16:42:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:01,043 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 2917 transitions. [2019-03-04 16:42:01,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 2917 transitions. [2019-03-04 16:42:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:42:01,045 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:01,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:42:01,045 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 28952946, now seen corresponding path program 1 times [2019-03-04 16:42:01,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:01,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:01,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:01,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:01,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:01,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:42:01,263 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [28], [31] [2019-03-04 16:42:01,265 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:01,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:01,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:01,268 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:01,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:01,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:01,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:01,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:01,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:01,288 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:42:01,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:01,292 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:42:01,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,298 INFO L453 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 27 treesize of output 29 [2019-03-04 16:42:01,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:42:01,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,317 INFO L453 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 31 treesize of output 33 [2019-03-04 16:42:01,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,338 INFO L453 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 33 treesize of output 35 [2019-03-04 16:42:01,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,360 INFO L453 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 35 treesize of output 37 [2019-03-04 16:42:01,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,426 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:42:01,427 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,442 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,458 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,474 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,489 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,503 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,519 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:01,577 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,585 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,596 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,613 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,640 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,673 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,721 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:01,722 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:42:01,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:42:01,766 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:42:01,843 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:42:01,843 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:152 [2019-03-04 16:42:01,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 85 [2019-03-04 16:42:01,924 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:02,047 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 97 [2019-03-04 16:42:02,048 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:42:02,222 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-03-04 16:42:02,222 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:195 [2019-03-04 16:42:02,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 78 treesize of output 107 [2019-03-04 16:42:02,417 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:42:02,835 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 73 treesize of output 96 [2019-03-04 16:42:02,836 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,030 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-03-04 16:42:03,030 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-03-04 16:42:03,329 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-03-04 16:42:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:03,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:03,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:03,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:42:03,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:03,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:03,400 INFO L87 Difference]: Start difference. First operand 396 states and 2917 transitions. Second operand 10 states. [2019-03-04 16:42:04,733 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:42:04,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:42:04,735 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)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-03-04 16:42:04,744 INFO L168 Benchmark]: Toolchain (without parser) took 129187.12 ms. Allocated memory was 141.6 MB in the beginning and 405.8 MB in the end (delta: 264.2 MB). Free memory was 109.1 MB in the beginning and 197.1 MB in the end (delta: -88.1 MB). Peak memory consumption was 176.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:04,744 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:42:04,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.36 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:04,745 INFO L168 Benchmark]: Boogie Preprocessor took 37.95 ms. Allocated memory is still 141.6 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:04,745 INFO L168 Benchmark]: RCFGBuilder took 469.28 ms. Allocated memory is still 141.6 MB. Free memory was 105.3 MB in the beginning and 93.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:04,745 INFO L168 Benchmark]: TraceAbstraction took 128612.34 ms. Allocated memory was 141.6 MB in the beginning and 405.8 MB in the end (delta: 264.2 MB). Free memory was 92.9 MB in the beginning and 197.1 MB in the end (delta: -104.2 MB). Peak memory consumption was 160.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:04,746 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.19 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.36 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.95 ms. Allocated memory is still 141.6 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.28 ms. Allocated memory is still 141.6 MB. Free memory was 105.3 MB in the beginning and 93.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 128612.34 ms. Allocated memory was 141.6 MB in the beginning and 405.8 MB in the end (delta: 264.2 MB). Free memory was 92.9 MB in the beginning and 197.1 MB in the end (delta: -104.2 MB). Peak memory consumption was 160.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)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...